Sciweavers

1802 search results - page 213 / 361
» Complexity Theory for Operators in Analysis
Sort
View
MOBIHOC
2003
ACM
16 years 6 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
HT
2009
ACM
16 years 28 days ago
Hyperincident connected components of tagging networks
Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of c...
Nicolas Neubauer, Klaus Obermayer
COMPGEOM
2006
ACM
16 years 12 days ago
Vines and vineyards by updating persistence in linear time
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy...
PPOPP
2005
ACM
15 years 12 months ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber
ISMIR
2001
Springer
121views Music» more  ISMIR 2001»
15 years 11 months ago
Musical Works as Information Retrieval Entities: Epistemological Perspectives
Musical works form a key entity for music information retrieval. Explicit linkage of relationships among entities is critical for document-based information retrieval. Works conta...
Richard P. Smiraglia