Sciweavers

2520 search results - page 451 / 504
» The complexity of approximating entropy
Sort
View
SEMWEB
2007
Springer
15 years 4 months ago
Change Paths in Reasoning!
Millions of research funding has been put down to develop - what I call - old forms - of reasoning that are characterized by strong focus on theoretical properties and strict adher...
Raphael Volz
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
15 years 4 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
ACSC
2006
IEEE
15 years 4 months ago
Modelling layer 2 and layer 3 device bandwidths using B-node theory
Modern computer networks contain an amalgamation of devices and technologies, with the performance exhibited by each central to digital communications. Varieties of methods exist ...
S. Cikara, Stanislaw P. Maj, David T. Shaw
ICRA
2006
IEEE
110views Robotics» more  ICRA 2006»
15 years 4 months ago
Speeding-up Rao-blackwellized SLAM
— Recently, Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter i...
Giorgio Grisetti, Gian Diego Tipaldi, Cyrill Stach...
MICRO
2006
IEEE
127views Hardware» more  MICRO 2006»
15 years 4 months ago
A Predictive Performance Model for Superscalar Processors
Designing and optimizing high performance microprocessors is an increasingly difficult task due to the size and complexity of the processor design space, high cost of detailed si...
P. J. Joseph, Kapil Vaswani, Matthew J. Thazhuthav...