Sciweavers

1449 search results - page 147 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
15 years 10 months ago
Scalable Parallel Data Mining for Association Rules
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
Eui-Hong Han, George Karypis, Vipin Kumar
COMPGEOM
2010
ACM
15 years 10 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
ATAL
2010
Springer
15 years 7 months ago
Decision making with dynamically arriving information
Decision making is the ability to decide on the best alternative among a set of candidates based on their value. In many real-world domains the value depends on events that occur ...
Meir Kalech, Avi Pfeffer
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 6 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
BMCBI
2006
120views more  BMCBI 2006»
15 years 6 months ago
Projections for fast protein structure retrieval
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...