Sciweavers

870 search results - page 98 / 174
» Gossip algorithms: design, analysis and applications
Sort
View
CIKM
2009
Springer
15 years 3 months ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
COMPUTER
2007
123views more  COMPUTER 2007»
14 years 11 months ago
Cryptography on a Speck of Dust
Ubiquitous computing has become a reality in recent years. Tiny wireless sensors and RFID tags are being deployed today and will soon form an important aspect of our infrastructur...
Jens-Peter Kaps, Gunnar Gaubatz, Berk Sunar
TOG
2008
143views more  TOG 2008»
14 years 11 months ago
Discovering structural regularity in 3D geometry
We introduce a computational framework for discovering regular or repeated geometric structures in 3D shapes. We describe and classify possible regular structures and present an e...
Mark Pauly, Niloy J. Mitra, Johannes Wallner, Helm...
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
15 years 5 months ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...
MICRO
2002
IEEE
108views Hardware» more  MICRO 2002»
15 years 4 months ago
Dynamic frequency and voltage control for a multiple clock domain microarchitecture
We describe the design, analysis, and performance of an on–line algorithm to dynamically control the frequency/voltage of a Multiple Clock Domain (MCD) microarchitecture. The MC...
Greg Semeraro, David H. Albonesi, Steve Dropsho, G...