Sciweavers

855 search results - page 166 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
14 years 11 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
90
Voted
CIDR
2009
129views Algorithms» more  CIDR 2009»
14 years 10 months ago
Extracting and Querying a Comprehensive Web Database
Recent research in domain-independent information extraction holds the promise of an automatically-constructed structured database derived from the Web. A query system based on th...
Michael J. Cafarella
JCB
2006
115views more  JCB 2006»
14 years 9 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger
VLDB
2002
ACM
154views Database» more  VLDB 2002»
14 years 9 months ago
I/O-Conscious Data Preparation for Large-Scale Web Search Engines
Given that commercial search engines cover billions of web pages, efficiently managing the corresponding volumes of disk-resident data needed to answer user queries quickly is a f...
Maxim Lifantsev, Tzi-cker Chiueh
EJWCN
2011
133views more  EJWCN 2011»
14 years 4 months ago
CARNIVORE: A Disruption-Tolerant System for Studying Wildlife
—This paper presents CARNIVORE, a system for in-situ, yet unobtrusive monitoring of cryptic, difficult-tocatch/observe wildlife in their natural habitat. CARNIVORE consists of a...
Matthew Rutishauser, Vladislav Petkov, Jay Boice, ...