Sciweavers

2180 search results - page 9 / 436
» Algorithms for discovering bucket orders from data
Sort
View
ECAI
2004
Springer
14 years 1 months ago
Using Constraints with Memory to Implement Variable Elimination
Abstract. Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and producesan equivalent networ...
Martí Sánchez, Pedro Meseguer, Javie...
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
14 years 8 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
ICSM
2007
IEEE
14 years 2 months ago
Discovering Dynamic Developer Relationships from Software Version Histories by Time Series Segmentation
Time series analysis is a promising approach to discover temporal patterns from time stamped, numeric data. A novel approach to apply time series analysis to discern temporal info...
Harvey P. Siy, Parvathi Chundi, Daniel J. Rosenkra...
WAE
2000
128views Algorithms» more  WAE 2000»
13 years 9 months ago
Planar Point Location for Large Data Sets: To Seek or Not to Seek
We present an algorithm for external memory planar point location that is both effective and easy to implement. The base algorithm is an external memory variant of the bucket metho...
Jan Vahrenhold, Klaus Hinrichs
HUC
2009
Springer
14 years 1 months ago
Discovering semantically meaningful places from pervasive RF-beacons
Detecting visits to semantically meaningful places is important for many emerging mobile applications. We present PlaceSense, a place discovery algorithm suitable for mobile devic...
Donnie H. Kim, Jeffrey Hightower, Ramesh Govindan,...