Sciweavers

363 search results - page 61 / 73
» About paths with two blocks
Sort
View
IJCAI
2007
13 years 11 months ago
Web Page Clustering Using Heuristic Search in the Web Graph
Effective representation of Web search results remains an open problem in the Information Retrieval community. For ambiguous queries, a traditional approach is to organize search ...
Ron Bekkerman, Shlomo Zilberstein, James Allan
NIPS
2001
13 years 11 months ago
Global Coordination of Local Linear Models
High dimensional data that lies on or near a low dimensional manifold can be described by a collection of local linear models. Such a description, however, does not provide a glob...
Sam T. Roweis, Lawrence K. Saul, Geoffrey E. Hinto...
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 8 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna
HCI
2009
13 years 7 months ago
Context-Aware Cognitive Agent Architecture for Ambient User Interfaces
An ambient user interface is a set of hidden intelligent interfaces that recognize user's presence and provides services to immediate needs. There are several research activit...
Youngho Lee, Choonsung Shin, Woontack Woo
PKC
2007
Springer
124views Cryptology» more  PKC 2007»
14 years 4 months ago
Practical and Secure Solutions for Integer Comparison
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
Juan A. Garay, Berry Schoenmakers, José Vil...