Sciweavers

1347 search results - page 114 / 270
» On the Structure of the Minimum Time Function
Sort
View
COMPGEOM
2004
ACM
15 years 9 months ago
Time-varying reeb graphs for continuous space-time data
The Reeb graph is a useful tool in visualizing real-valued data obtained from computational simulations of physical processes. We characterize the evolution of the Reeb graph of a...
Herbert Edelsbrunner, John Harer, Ajith Mascarenha...
136
Voted
JACM
2000
131views more  JACM 2000»
15 years 3 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
STOC
2003
ACM
122views Algorithms» more  STOC 2003»
16 years 4 months ago
Learning juntas
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
73
Voted
ISBI
2004
IEEE
16 years 4 months ago
Automatic Quantification of Microtubule Dynamics
The dynamics of the microtubule assembly are very significant both for cell function and structure. Abnormal function of the assembly is involved in neurodegenerative diseases and...
Stathis Hadjidemetriou, James S. Duncan, Derek Too...
158
Voted
SNPD
2003
15 years 5 months ago
Pattern Matching of Parallel Values in Bulk Synchronous Parallel ML
We have designed a functional data-parallel language called BSML for programming bulk-synchronous parallel (BSP) algorithms in so-called direct mode. In a directmode BSP algorithm...
Frédéric Gava, Frédéri...