Sciweavers

2272 search results - page 383 / 455
» Capture Complexity by Partition
Sort
View
DASFAA
2006
IEEE
121views Database» more  DASFAA 2006»
15 years 3 months ago
Distributed Network Querying with Bounded Approximate Caching
Abstract. As networks continue to grow in size and complexity, distributed network monitoring and resource querying are becoming increasingly difficult. Our aim is to design, build...
Badrish Chandramouli, Jun Yang 0001, Amin Vahdat
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
15 years 3 months ago
Fast C-obstacle Query Computation for Motion Planning
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
ICPADS
2005
IEEE
15 years 3 months ago
A Model for Distributing and Querying a Data Warehouse on a Computing Grid
Data warehouses store large volumes of data according to a multidimensional model with dimensions representing different axes of analysis. OLAP systems (OnLine Analytical Processi...
Pascal Wehrle, Maryvonne Miquel, Anne Tchounikine
INFOVIS
2005
IEEE
15 years 3 months ago
The Visual Code Navigator: An Interactive Toolset for Source Code Investigation
We present the Visual Code Navigator, a set of three interrelated visual tools that we developed for exploring large source code software projects from three different perspective...
Gerard Lommerse, Freek Nossin, Lucian Voinea, Alex...
MICRO
2005
IEEE
126views Hardware» more  MICRO 2005»
15 years 3 months ago
Cost Sensitive Modulo Scheduling in a Loop Accelerator Synthesis System
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
Kevin Fan, Manjunath Kudlur, Hyunchul Park, Scott ...