d****n
发帖数: 1637 | 1 In your search function, you need to use the typename keyword to give
the compiler the extra hint that BinarySearchTree::tree_node is a
type. Node in your class class is still an incomplete type with template
type in. In VC it may work without typename.(not tested)
template
typename BinarySearchTree::tree_node*
BinarySearchTree::search(tree_node* p, T d)
{
if(p==NULL||d==p->data)
return p;
else if(d>p->data)
return search(p->right,d);
else
re... 阅读全帖 |
|
o**a
发帖数: 1315 | 2 进来学习。
Binary search是说用B tree index?
ID是primary key的话，在这个search key上的index通常是clustered and ordered.
可以在value上建secondary nonclustered index，怎么order应该可以自己指定吧？
另外，value是不是一个nonunique search key。
能不能考虑用composite search key? |
|
p******h
发帖数: 1783 | 3 用desktop search search 什么？
免
收
search |
|
k******y
发帖数: 1407 | 4 这个建议你还是慎言为好
Windows Server 2016 哪怕 Desktop Experience 默认 search 是 not activate 的，
但是搜索栏依然放在那里 没有任何提示说不能用 只不过你搜索不到任何有用的东西
而已 微软的逻辑是search and index会影响服务器性能，但是 用户 你没有必要知道
我做了这件事也没有义务提醒你
另外 内置的 Administrator 账号 无论如何 search 都不 work， 哪怕你 activate
了 search 这个服务 外加 rebuild index 一遍又一遍 另外设置一个 admin 权限的账号
就一切正常； 微软的内在逻辑是 build-in admin和 User Account Control (UAC) 是
冲突的 …… again, 用户你没有必要知道为什么我做了这件事，我也没有义务提醒你
习惯了Linux的人 无时无刻不能感受到Windows的arrogant，和软件业经常遇到的一些
族裔的性格逻辑一模一样： 你没有必要知道为什么我做了这件事，我也没有义务提醒你
copy xcop... 阅读全帖 |
|
t****t
发帖数: 2269 | 5 【 以下文字转载自 Java 讨论区 】
发信人: teapot (不锈钢作品), 信区: Java
标 题: 哪位在自己的website里用过google search bar?给回答一下基础问题吧
发信站: BBS 未名空间站 (Mon Dec 11 10:42:57 2006)
我有的是一个java, jsp的application,想在里面加一个google search，这样可以搜索
网页之内的内容。
想问一下这种情况是不是很难实现，要不要买google的产品？
我们学校主页上有google search，我看说是可以先向他们注册，然后可以直接用。但
是我们要用的话，是不是要求我们的网页是公开访问的才行。如果是必须登录才能看到
的网页，这样的search是不是就没用了？
多谢。我是没入门级，高手请给指点一下。 |
|
c***d
发帖数: 996 | 6 ☆─────────────────────────────────────☆
teapot (不锈钢作品) 于 (Mon Dec 11 10:44:51 2006) 提到:
发信人: teapot (不锈钢作品), 信区: Java
标 题: 哪位在自己的website里用过google search bar?给回答一下基础问题吧
发信站: BBS 未名空间站 (Mon Dec 11 10:42:57 2006)
我有的是一个java, jsp的application,想在里面加一个google search，这样可以搜索
网页之内的内容。
想问一下这种情况是不是很难实现，要不要买google的产品？
我们学校主页上有google search，我看说是可以先向他们注册，然后可以直接用。但
是我们要用的话，是不是要求我们的网页是公开访问的才行。如果是必须登录才能看到
的网页，这样的search是不是就没用了？
多谢。我是没入门级，高手请给指点一下。
☆─────────────────────────────────────☆
bugzilla (report a |
|
|
w***g
发帖数: 5958 | 8 Google用什么方法我不知道。但是分析搜索结果我猜用了下面几种技术：
1. reverse image search，搜同一个图的不同版本. 用SIFT, SURF等local feature。
我的那个软件就是做这个的。
2. search by visual similarity. 可以简单地想像成按color histogram搜。Google
可能有比color histogram牛得多的特征。
3. search by surrounding text。
4. 可能还有别的零散的技术，比如人脸识别对象识别等等，从图片中抽取关键字。考
虑到Google财大气粗，甚至有能力对人进行建模，检测到人以后可以对前景/背景分别
提取特征。最近应该也用上了neural network吧。但neural network给出的标签应该是
非常high-level的，对搜索帮助不会特别大。
最后把所有的结果rank一下，出来大概就是这个结果。Google确实是牛。我见过一眼负
责image search的那个老头，一脸苦B的样子，可能压力也非常大。
结果 |
|
|
S******y
发帖数: 1123 | 10 I have 100,000 + text files. The total size of those files are about 30 GBs.
I would like to pre-index those files regarding a bunch of keywords to
search.
For example, I type "cat" + "dog", the python pgm would return snippets of
text from those files (Just like Google search), sorted by the distances
between two words.
Is there a smart algorithm to do that?
I am thinking -
for 'cat', search all files, and record which file and which location the
word appear.
for 'dog', search all files, and re |
|
|
a*********7
发帖数: 30080 | 12 不是100％肯定，不过我想差别在于，registered users可以看见自己为ocef捐了多少
钱，non-registered看不见。不过同样是1cent/search.
另外registered users还能参加“Good Achievements”
Good Achievements
What are status badges?
We award our registered GoodSearch users with badges that reflect the good
actions that they're taking to make a difference! In addition to raising
funds for their charities, registered users will earn points whenever they
search, shop, add the toolbar, share site content and invite friends to
register. Earning more points wi... 阅读全帖 |
|
m*****f
发帖数: 185 | 13 Many West Coast residents came up empty handed in their search of potassium
iodide this week as fears over radiation spreading from Japan took hold.
The rush on the supplement came even as emergency management officials said
there is no need to take the pills believed to prevent the thyroid from
absorbing radiation.
"I didn't see too many people concerned about it. But when it was sold out,
it made me think that I should be concerned," said Hameed Hemmat, who lives
in the San Francisco Bay area.... 阅读全帖 |
|
g**1
发帖数: 10330 | 14 http://www.huffingtonpost.com/2013/07/28/glenn-greenwald-nsa_n_
Glenn Greenwald: NSA Analysts Have Access To 'Powerful and Invasive' Search
Tools
"The NSA has trillions of telephone calls and emails in their databases that
they’ve collected over the last several years," Greenwald said on ABC News
' "This Week with George Stephanopoulos." "What these programs are, are very
simple screens, like the ones that supermarket clerks or shipping and
receiving clerks use, where all an analyst has to do is... 阅读全帖 |
|
S******8
发帖数: 24594 | 15 Absolutely. Recent news of bias in online search results regarding political
candidates is not surprising considering the close relationship the company
has with the White House. Google in general is definitely biased toward the
Democratic Party, as the founders have supported Obama since before his
presidency. Google was one of Obama's largest supporters, raising around $
803,000. Thus, when he began his term many Google employees became members
of the Obama administration.
With the upcoming el... 阅读全帖 |
|
发帖数: 1 | 16 Google received criticism after searches for "presidential candidates"
omitted Republican Donald Trump.
Earlier Wednesday morning, searching for ‘presidential candidates’ brought
up a handy guide above all of the other search results with pictures of
candidates with active campaigns.The only problem is that Republican
candidate Donald Trump wasn’t included.
这是在追赶白度吗？ |
|
w*s
发帖数: 7227 | 17 【 以下文字转载自 Programming 讨论区 】
发信人: guvest (我爱你老婆Anna), 信区: Programming
标 题: Re: 对于编程，有没有替代google的search engine ?
发信站: BBS 未名空间站 (Thu Feb 2 00:34:58 2017, 美东)
这家的老板以前发明的广告竞价排名。goog抄去的。
Goto.com和他们是同一帮人。
Goog 那page rank只是搜索引擎的一种。
抄了竞价排名，资本进入正循环，算法的实现提高，
然后才起来的。
搜索算法本身其实没多少短长。
另外你搜一下search engine filter bubble
: 好像有10 个别的search engine, 为啥这个呢？
|
|
发帖数: 1 | 18 Title: Applied Scientist for Search
Job Location: Santa Clara, CA
Job Type: Full-time
Responsibilities:
Include but not limited the following three main directions:
• Develop C++-based runtime system to provide better user experience
to our
customers;
• Implement prototypes of the algorithms and models in C++/Python
• Identify appropriate metrics to measure the performance of search
system.
Qualifications:
• Master or Ph.D. in Computer Science, Electrical and Computer
En... 阅读全帖 |
|
z*****i
发帖数: 389 | 19 【 以下文字转载自 Mathematics 讨论区 】
发信人: zanetti (篮黑), 信区: Mathematics
标 题: 咨询关于AMS annual meeting上和Search Committee 见面的问题
发信站: BBS 未名空间站 (Mon Nov 29 21:58:31 2010, 美东)
各位大牛好,
今天收到一个貌似还不错的学校的小秘给我发的信,说
Search Committee will be attending the AMS meeting from January 6-9, 2011,
New Orleans, LA. As such, please let us know if you’ll be attending the
meeting and the suitable dates/timeslots, so that we may proceed with
further arrangements.
今年我没有打算去AMS meeting. 如果我回信给search committee说我不去AMS meeting
, 他们是不是就... 阅读全帖 |
|
C**k
发帖数: 275 | 20 Search Chair 要 detailed research statement:
Your area of research is of interest to us. Your statement of research ,
however, is not sufficiently detailed for us to make an evaluation.
我的 research statement 3页, 列的方向, 一个和search chair互补, 一个和search
chair 的topic 相同, 方法策略不同.
如何处理比较好 ? 谢谢 |
|
E********e
发帖数: 1734 | 21 Phone interview本来是search committee考job candidate。可是上次Phone
interview快结束的时候，按照常规search committee问我有什么问题要问他们。我问
了一个问题，search committee chair结结巴巴没法回答。我把他问倒了，后悔呀。 |
|
y*******u
发帖数: 268 | 22 近期地址更换，写信告诉search chair，面试路费寄到新地址，顺带问了问search
progress，得到的回复是“We are still in deliberations for candidate
selection.”这句怎么理解啊？是说已经决定了top，等dean和provost批准呢，还是说
search committee还在关着门为了选谁在掐架。 |
|
g*******3
发帖数: 16 | 23 申请了个TT AP的位置.现在所有的候选人都面试完了, Search committee 正准备要开
会投票确定最终的人选.
他们这次总共要招2个人, 候选人总共是6个. 我让那边认识的人打听了下其他候选人
的情况: 基本是3个人在竞争,我算其中一个. 另外一个是在top5的医学院PHD毕业,然
后继续在那里做postdoc,文章也比较强.我感觉他很可能要占据一个名额.最后一个在一
般的学校,做的东西一般,手段也很单一.但此人有个multi-PI的从今年才开始的R0. 我
的文章情况是弱于前一个,但比后者强,此外,我只有一个很小的2年的grant.
search committee chair 认识我现任老板和前任老板. 我和他是校友,都在同一个系呆
过,但他很早就离开了那个系,和我没有交集. 一开始申请的时候,chair也私下写信给
我现任老板询问过我的情况. 2个老板写的推荐信算比较强和详细 (他们在发之前让我
看了看).
想请教下大家,这个关键时候需要现任和前任老板给这个chair再写个信或者打个电话推
荐下吗?会不会起到反作用招人家烦呢,人家会不会觉的这是压力? 在... 阅读全帖 |
|
M***D
发帖数: 478 | 24 onsite当天，有与search committee群面，之前的几个小时，和某些有单独面试。
请问，这个与search committee群面都是面试什么？应该如何把握？
视频面试时，已经见过search committee了。 |
|
c***t
发帖数: 91 | 25 onsite一周之后收到search committee chair的邮件：
标题是“Update on our search”，以下是正文：
Dear XX,
We were excited to have you visit and present your research and teaching
plans. The search committee has concluded the on-site interview process and
has formulated a recommendation for hiring. This recommendation needs to be
considered by the department faculty and the resulting recommendation will
be forwarded to the Chair and Dean.
You should anticipate hearing from The University of XXX shortly.
Sincerely,
XXXX
各... 阅读全帖 |
|
c***t
发帖数: 91 | 26 onsite一周之后收到search committee chair的邮件：
标题是“Update on our search”，以下是正文：
Dear XX,
We were excited to have you visit and present your research and teaching
plans. The search committee has concluded the on-site interview process and
has formulated a recommendation for hiring. This recommendation needs to be
considered by the department faculty and the resulting recommendation will
be forwarded to the Chair and Dean.
You should anticipate hearing from The University of XXX shortly.
Sincerely,
XXXX
各... 阅读全帖 |
|
C**********n
发帖数: 100 | 27 问个很基本的问题。
假定某个binary search tree和max heap都是有输入一些数字序列所构成，
那么是不是binary search tree跟输入数字的顺序无关，只可能有一种binary search
tree,
但max heap(或min heap)则跟输入数字的顺序有关，同样的几个数字，输入顺序不同所
形成的max heap也不一样？ |
|
s******t
发帖数: 2374 | 28 我想了好久还是不知道怎么用递归做。。。
笨死了。
上来求教一下，不想浪费时间了。
如果inorder，可以用static变量的话我似乎还能写一个出来，不过static变量应该是不被favorable的吧。。。
static int = k;
void search(Node cur){
if(cur == null || index < 0) return;
search(cur.left);
if(--index == 0) {System.out.println(cur.value); return;}
search(cur.right);
}
很土。。。。感觉是totally wrong.... |
|
s******t
发帖数: 2374 | 29 难道是这么写？
int search(Node cur, int index){
if(cur == null) return index;
if(index < 0) return -1;
index = search(cur.left, index);
if(--index == 0) {System.out.println(cur.value); return -1;}
index = search(cur.right, index);
return index;
} |
|
s*********t
发帖数: 1663 | 30 你想个数，让小孩子猜，你告诉他大了还是小了，直到猜对，这就是个binary search呀
比如你想的是5， 小孩猜8，你告诉他太大，他下次如果猜1到8之间的，就说明他明白b
inary search思想，否则就是他的大脑还没发育
当然这个例子并不是二分的，他如果知道往范围的中间去猜，难就是个binary search |
|
f******6
发帖数: 723 | 31 就是在google search bar里面输入mp3，google会suggest诸如mp3 download, mp3
players...之类的被大家search过的以mp3开头的top 10 frequent search phrases.
请问用什么data structure做的呢？谢谢！ |
|
f********3
发帖数: 38 | 32 careercup 上有这个题 的答案
如果碰到空的str怎么办,找下一个非空的str,这样worst case就是o(n)不是o(logn)了
search(int start,int end){
mid=(start+end)/2;
while(str[mid]==' ') {mid++;}
r=strcmp(str1[mid+1,mid+1+str2.length()],str2);
if(r==0) return mid;
else if(r<0) search(mid+1,end);
else search(start,mid-1);
} |
|
a**p
发帖数: 258 | 33 同意楼上说的。search是重点。写了点玩玩，看看对不对。
public class Test {
Task[] list;
int search(Task task) {
int i = 0;
do {
if (task.deadline <= list[i].deadline) {
return i;
}
} while (++i < list.length);
return list.length-1;
}
int binarySearch(Task task) {
int i = list.length;
int k = 0;
int j;
do {
if ((i+1 + k) % 2 != 0){
j = (i+k)/2;
} else{... 阅读全帖 |
|
l***g
发帖数: 1035 | 34 joke? google had a thing called google desktop, which was faster than the xp
explorer search. xp search was slooooowwww... but at least worked... the wi
n7 stupid search trys to appear simple, but does not work.
in |
|
p*****2
发帖数: 21240 | 35 玩竞赛对面试不利的一个地方就是面试经常遇到的数据结构比如LinkedList, Tree, 和
算法Binary
search，竞赛很少涉及到，因此一直心里都感觉到有些不安。
Binary search非常tricky，虽说道理简单，但是面试的时候却很容易出bug，因此总结
一下是必须的。假设i=0,
j=A.length-1, 我做了一下LeetCode上的所有binary
search的题目，发现了以下几点值得注意。
http://blog.sina.com.cn/s/blog_b9285de20101h88j.html |
|
f*********m
发帖数: 726 | 36 leetcode 上的Unique Binary Search Trees,算总的Binary Search Trees数目：
Given n, how many structurally unique BST's (binary search trees) that store
values 1...n?
可以用dp:
int dp[n+1];
memset(dp, 0, (n+1)*sizeof(int));
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i <= n; i++) {
for (int j = 0; j < i; j++) {
dp[i] += dp[j]*dp[i-j-1];
}
}
return dp[n];
若是要算总的Trees数目，那应该是
dp[i] += 2*dp[j]*dp[i-j-1]吧？
既一个节点既可以出现在根的左边，又可以出现在右边？ |
|
x*****0
发帖数: 452 | 37 The question is:
Check if a binary tree is a valid binary search tree.
I guess I can pass the definition of the binary search tree in this forum. :
-). I know this is a very basic question and have a lot of solutions with O(
N) time complexity and O(1) space complexity.
Since I'm practicing how to use bottom-up traversal skill, Let's restrict
the answer must be bottom-up traversal algorithm.
The following is my idea.
Using "min" and "max" to represent the minimum value of left sub-tree and
maxim... 阅读全帖 |
|
g***j
发帖数: 1275 | 38 我的基本framework是这样的
int xxxx(int x) {
int start = xxx; // the start point to search, for sqrt, it's 1
// generally it's 0, means the first element;
int end = xxx; // the end point to search, for sqrt, it's x
// generally it's n-1, means the last element;
int mid = 0;
while(start <= end ) { // = is needed here
mid = start + (end - start)/... 阅读全帖 |
|
r********d
发帖数: 7742 | 39 很上心，学习了，赞！
我刚才正好在写search for range，这是我写的search for start和你的不太一样。
int BinarySearchStart(int A[], int lo, int hi, const int &target) {
if (lo > hi) return -1;
while (hi >= lo) {
int mi = lo + (hi-lo)/2;
if (target == A[mi] && (mi-1 < lo || A[mi-1] < target)) {
return mi;
} else if (A[mi] < target) { //have to do this one first
lo = mi+1;
} else {
hi = mi-1;
}
}
... 阅读全帖 |
|
d*******n
发帖数: 124 | 40 我想找一个google search offline的工具，可以基于keyword search 我的document。
可是google desktop discontinue了，还有没有alternative呢。
P.S.不是类似document内部和eclipse内部的那种基于keyword或regexp的search，因为
那些都是hard match而不是soft match。 By soft match, I mean using LCS. |
|
S*******C
发帖数: 822 | 41 有人说 worst time cost. 如果树里有环，DFS会不会结束。
有人说 it does not decide “what to do next” by examining the content of an
intermediate problem space, which means that it cannot take advantage of
noticing that the current state of the problem is near a solution.
还有人说
The disadvantage of Depth-First Search is that there is a possibility
that it may go down the left-most path forever. Even a finite graph can
generate an infinite tree. One solution to this problem is to impose a
cutoff depth on the search. ... 阅读全帖 |
|
j*********0
发帖数: 42 | 42 我是Search組的Jerry
內推 WalmartLabs Search組 急需3名Front End Developers
Strong in coding and understanding of Javascript and CSS.
Algorithms and Java is a plus.
內推的請寄resume到 [email protected]
/* */
工作內容
Position Description
• Work with talented engineers to contribute to the vision and design
of Walmart.com’s search, browse and category pages for desktop and mobile
properties
• Work with cutting-edge JavaScript libraries and framework like
ReactJS and Backbone.js
• Write good cod... 阅读全帖 |
|
A*******e
发帖数: 2419 | 43 adwords是google网站上搜索时看到的广告，adsense for search是使用google search
engine的非google网站上的广告，比如AOL？
两个都属于search ads？ |
|
b**********5
发帖数: 7881 | 44 yahoo has a search team now? i though they use bing to provide search result
. I know they started a search project on the side a year ago... but that
was not a team. |
|
b**********5
发帖数: 7881 | 45 u sure? yahoo has been using bing as their search partner... not really
doing their own search... unless u r mistaking search with ads... |
|
h*****u
发帖数: 109 | 46 这是很好的问题。看起来简单。
binary search 如果用 while(l < r)那么结束时有可能l = r。所以你还要判断一次。
不能直接return false. 所以用while(l <= r)好。注意l = mid + 1如果换成l = mid
可能deadlock. 同理r也是如此。
如果在rotated array里找最小值。用while(l < r)好。最后点l=r就是最值
对于这种ordered structure (sorted array, bst, sqrt(对应函数是平方)，正整数
divide)都可以用binary search。 binary search的更本质的想法是region
elimination on sorted structure. 你用这个理解，什么first occurrence of an
element等就好懂了。 |
|
f******h
发帖数: 45 | 47 更新
search platform runtime招java backend developer，需两年以上经验
search platform big data招sde，各种level都可以试，最好有点大数据和linux经验
若对以上职位或公司网站上其他职位感兴趣，请发简历到[email protected]
关于location：labs主要在Sunnyvale和San Bruno；search team在Sunnyvale。 |
|
m********u
发帖数: 3942 | 48 multiple openings，在硅谷，有兴趣请站内或者邮件 [email protected]
Responsibilities:
Include but not limited the following three main directions:
• Apply machine learning/Deep Learning models to improve search
relevance;
• Provide personalized search results based on user behaviors;
• Work closely with software engineering teams to drive feature
engineering and improve model accuracy.
Qualifications:
• Master or Ph.D. in Computer Science, Electrical and Computer
Engineering, Statist... 阅读全帖 |
|
发帖数: 1 | 49 Title: Applied Scientist for Search
Job Location: Santa Clara, CA
Job Type: Full-time
Responsibilities:
Include but not limited the following three main directions:
• Develop C++-based runtime system to provide better user experience
to our
customers;
• Implement prototypes of the algorithms and models in C++/Python
• Identify appropriate metrics to measure the performance of search
system.
Qualifications:
• Master or Ph.D. in Computer Science, Electrical and Computer
En... 阅读全帖 |
|
t****g
发帖数: 35582 | 50 看上了一个short sale的condo，准备下offer。
agent告诉我们说去做个title search看看现在的owner到底有几个loan，lien， HOA欠
费等等事情。
我找了一下网上的title search大概$100左右，agent推荐一个律师给做大概200多。
想问一下自己去网上做title search和律师做有什么大的区别么？ |
|
