Sciweavers

3838 search results - page 157 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
COMPGEOM
2004
ACM
15 years 9 months ago
Deterministic sampling and range counting in geometric data streams
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...
Amitabha Bagchi, Amitabh Chaudhary, David Eppstein...
FLAIRS
2003
15 years 5 months ago
Information Filtering Using the Dynamics of the User Profile
This paper presents an adaptive algorithm for learning the user profile. The user profile is learned incrementally and continuously based on user’s initial profile, his actions ...
Costin Barbu, Marin Simina
MASCOTS
2003
15 years 5 months ago
Toward Scaling Network Emulation using Topology Partitioning
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the n...
Ken Yocum, Ethan Eade, Julius Degesys, David Becke...
ICCAD
2004
IEEE
118views Hardware» more  ICCAD 2004»
16 years 22 days ago
Optimizing mode transition sequences in idle intervals for component-level and system-level energy minimization
New embedded systems offer rich power management features in the form of multiple operational and non-operational power modes. While they offer mechanisms for better energy effic...
Jinfeng Liu, Pai H. Chou
SPAA
1993
ACM
15 years 8 months ago
Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
Philip D. MacKenzie, Quentin F. Stout