Sciweavers

2485 search results - page 482 / 497
» Time Bounded Frequency Computations
Sort
View
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
LATIN
2004
Springer
14 years 1 months ago
Approximating the Expressive Power of Logics in Finite Models
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
Argimiro Arratia, Carlos E. Ortiz
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 15 days ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
ISORC
2000
IEEE
14 years 2 days ago
A Vision of the Future for the Air Force (and Perhaps the Whole DoD)
The Air Force has enthusiastically endorsed, at its most senior levels, advanced thinking with regard to the application of information technology. Recently, the notion of a Joint...
Thomas F. Saunders
DAC
2010
ACM
13 years 11 months ago
PreDVS: preemptive dynamic voltage scaling for real-time systems using approximation scheme
System optimization techniques based on dynamic voltage scaling (DVS) are widely used with the aim of reducing processor energy consumption. Inter-task DVS assigns the same voltag...
Weixun Wang, Prabhat Mishra