Sciweavers

1731 search results - page 246 / 347
» Maximum likelihood analysis of algorithms and data structure...
Sort
View
DEXAW
2009
IEEE
160views Database» more  DEXAW 2009»
14 years 2 months ago
Automatic User Comment Detection in Flat Internet Fora
—Millions of people are using the World Wide Web and are publishing content online. This user generated content contains many information relevant not only to marketing but to co...
Mathias Bank, Michael Mattes
ISQED
2006
IEEE
116views Hardware» more  ISQED 2006»
14 years 1 months ago
Probabilistic Delay Budgeting for Soft Realtime Applications
Unlike their hard realtime counterparts, soft realtime applications are only expected to guarantee their ”expected delay” over input data space. This paradigm shift calls for ...
Soheil Ghiasi, Po-Kuan Huang
DAGSTUHL
2007
13 years 9 months ago
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
Bodo Manthey, Till Tantau
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 8 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
EDBT
2008
ACM
167views Database» more  EDBT 2008»
14 years 8 months ago
HISSCLU: a hierarchical density-based method for semi-supervised clustering
In situations where class labels are known for a part of the objects, a cluster analysis respecting this information, i.e. semi-supervised clustering, can give insight into the cl...
Christian Böhm, Claudia Plant