Sciweavers

62 search results - page 11 / 13
» A Fuzzy Algorithm for the Efficient Utilization of Informati...
Sort
View
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
14 years 1 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
14 years 8 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande
JUCS
2007
112views more  JUCS 2007»
13 years 7 months ago
Internet Path Behavior Prediction via Data Mining: Conceptual Framework and Case Study
: In this paper we propose an application of data mining methods in the prediction of the availability and performance of Internet paths. We deploy a general decision-making method...
Leszek Borzemski
SASO
2007
IEEE
14 years 1 months ago
In Search of Simplicity: A Self-Organizing Group Communication Overlay
Group communication primitives have broad utility as building blocks for distributed applications. The challenge is to create and maintain the distributed structures that support ...
Matei Ripeanu, Adriana Iamnitchi, Ian T. Foster, A...
PODS
2006
ACM
216views Database» more  PODS 2006»
14 years 7 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...