Sciweavers

3210 search results - page 127 / 642
» Secure Similarity Search
Sort
View
92
Voted
WWW
2009
ACM
16 years 5 months ago
Content hole search in community-type content
In community-type content such as blogs and SNSs, we call the user's unawareness of information as a "content hole"and the search for this information as a "co...
Akiyo Nadamoto, Eiji Aramaki, Takeshi Abekawa, Yoh...
151
Voted
AAAI
2006
15 years 6 months ago
Estimating Search Tree Size
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological ba...
Philip Kilby, John K. Slaney, Sylvie Thiéba...
AAAI
2006
15 years 6 months ago
Memory Intensive Branch-and-Bound Search for Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sens...
Radu Marinescu 0002, Rina Dechter
138
Voted
IJWGS
2008
116views more  IJWGS 2008»
15 years 5 months ago
Harnessing user contributions and dynamic profiling to better satisfy individual information search needs
: In the situation of information overload we are experiencing today, conventional web search systems taking a one-size-fits-all approach are often not capable of effectively satis...
Roman Y. Shtykh, Qun Jin
KDD
2012
ACM
281views Data Mining» more  KDD 2012»
13 years 7 months ago
Active spectral clustering via iterative uncertainty reduction
Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straightforw...
Fabian L. Wauthier, Nebojsa Jojic, Michael I. Jord...