Sciweavers

10890 search results - page 386 / 2178
» Automatic Complexity Analysis
Sort
View
JC
2006
139views more  JC 2006»
15 years 6 months ago
The basic feasible functionals in computable analysis
We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one cons...
Branimir Lambov
VIS
2006
IEEE
157views Visualization» more  VIS 2006»
16 years 8 months ago
Analyzing Complex FTMS Simulations: a Case Study in High-Level Visualization of Ion Motions
Current practice in particle visualization renders particle position data directly onto the screen as points or glyphs. Using a camera placed at a fixed position, particle motions...
Wojciech Burakiewicz, Robert van Liere
EMSOFT
2007
Springer
16 years 29 days ago
Methods for multi-dimensional robustness optimization in complex embedded systems
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...
Arne Hamann, Razvan Racu, Rolf Ernst
INFOCOM
2005
IEEE
16 years 11 days ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
DOCENG
2004
ACM
16 years 6 days ago
Techniques for authoring complex XML documents
This paper reviews the main innovations of XML and considers their impact on the editing techniques for structured documents. Namespaces open the way to compound documents; well-f...
Vincent Quint, Irène Vatton