Sciweavers

447 search results - page 74 / 90
» Improving the aggregating algorithm for regression
Sort
View
SIGMOD
2008
ACM
131views Database» more  SIGMOD 2008»
14 years 7 months ago
Discovering topical structures of databases
The increasing complexity of enterprise databases and the prevalent lack of documentation incur significant cost in both understanding and integrating the databases. Existing solu...
Wensheng Wu, Berthold Reinwald, Yannis Sismanis, R...
COMCOM
2007
149views more  COMCOM 2007»
13 years 7 months ago
Cache invalidation strategies for internet-based mobile ad hoc networks
Internet-based mobile ad hoc network (IMANET) combines a mobile ad hoc network (MANET) and the Internet to provide universal information accessibility. Although caching frequently...
Sunho Lim, Wang-Chien Lee, Guohong Cao, Chita R. D...
VLDB
1997
ACM
126views Database» more  VLDB 1997»
13 years 11 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
HT
2005
ACM
14 years 1 months ago
As we may perceive: inferring logical documents from hypertext
In recent years, many algorithms for the Web have been developed that work with information units distinct from individual web pages. These include segments of web pages or aggreg...
Pavel Dmitriev, Carl Lagoze, Boris Suchkov
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 8 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe