Sciweavers

8196 search results - page 1375 / 1640
» Computational Modeling and Complexity Science
Sort
View
134
Voted
MOBICOM
2005
ACM
15 years 10 months ago
MAP: medial axis based geometric routing in sensor networks
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
ICPP
1995
IEEE
15 years 8 months ago
Progress: A Toolkit for Interactive Program Steering
Interactive program steering permits researchers to monitor and guide their applications during runtime. Interactive steering can help make end users more effective in addressing ...
Jeffrey S. Vetter, Karsten Schwan
164
Voted
BIRTHDAY
2010
Springer
15 years 5 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
BMCBI
2004
126views more  BMCBI 2004»
15 years 4 months ago
Visualization and analysis of microarray and gene ontology data with treemaps
Background: The increasing complexity of genomic data presents several challenges for biologists. Limited computer monitor views of data complexity and the dynamic nature of data ...
Eric H. Baehrecke, Niem Dang, Ketan Babaria, Ben S...
CJTCS
1999
133views more  CJTCS 1999»
15 years 4 months ago
The Permanent Requires Large Uniform Threshold Circuits
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
Eric Allender
« Prev « First page 1375 / 1640 Last » Next »