Sciweavers

1480 search results - page 201 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
95
Voted
WEBDB
2010
Springer
143views Database» more  WEBDB 2010»
15 years 5 months ago
Querying Wikipedia Documents and Relationships
Wikipedia has become an important source of information which is growing very rapidly. However, the existing infrastructure for querying this information is limited and often igno...
Huong Nguyen, Thanh Nguyen, Hoa Nguyen, Juliana Fr...
125
Voted
CIKM
2011
Springer
14 years 24 days ago
Semi-supervised multi-task learning of structured prediction models for web information extraction
Extracting information from web pages is an important problem; it has several applications such as providing improved search results and construction of databases to serve user qu...
Paramveer S. Dhillon, Sundararajan Sellamanickam, ...
86
Voted
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
16 years 1 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
ESA
2007
Springer
115views Algorithms» more  ESA 2007»
15 years 7 months ago
Approximation of Partial Capacitated Vertex Cover
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
Reuven Bar-Yehuda, Guy Flysher, Julián Mest...
104
Voted
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 1 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel