1632 search results - page 5 / 327 » Sublinear Time Algorithms for Metric Space Problems |
DEXA
2008
Springer
14 years 11 months ago
2008
Springer
Information filtering systems constitute a critical component in modern information seeking applications. As the number of users grows and the information available becomes even bi...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
159
click to vote
VLDB
2006
ACM
15 years 9 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
82
Voted
STOC
2003
ACM
15 years 9 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
CC
2008
Springer
14 years 9 months ago
2008
Springer
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...