Sciweavers

477 search results - page 32 / 96
» Removing even crossings
Sort
View
HICSS
2009
IEEE
108views Biometrics» more  HICSS 2009»
14 years 2 months ago
Approximate Dynamic Programming in Knowledge Discovery for Rapid Response
One knowledge discovery problem in the rapid response setting is the cost of learning which patterns are indicative of a threat. This typically involves a detailed follow-through,...
Peter Frazier, Warren B. Powell, Savas Dayanik, Pa...
ICRA
2009
IEEE
157views Robotics» more  ICRA 2009»
14 years 2 months ago
From pixels to objects: Enabling a spatial model for humanoid social robots
— This work adds the concept of object to an existent low-level attention system of the humanoid robot iCub. The objects are defined as clusters of SIFT visual features. When th...
Dario Figueira, Manuel Lopes, Rodrigo M. M. Ventur...
INFOCOM
2009
IEEE
14 years 2 months ago
Capacity Provisioning a Valiant Load-Balanced Network
—Valiant load balancing (VLB), also called two-stage load balancing, is gaining popularity as a routing scheme that can serve arbitrary traffic matrices. To date, VLB network de...
Andrew R. Curtis, Alejandro López-Ortiz
COMPGEOM
2009
ACM
14 years 2 months ago
On grids in topological graphs
A topological graph is a graph drawn in the plane with vertices represented by points and edges as arcs connecting its vertices. A k-grid in a topological graph is a pair of edge ...
Eyal Ackerman, Jacob Fox, János Pach, Andre...
ICC
2008
IEEE
118views Communications» more  ICC 2008»
14 years 2 months ago
Bounded-Variance Network Calculus: Computation of Tight Approximations of End-to-End Delay
Abstract ⎯ Currently, the most advanced framework for stochastic network calculus is the min-plus algebra, providing bounds for the end-to-end delay in networks. The bounds calcu...
Paolo Giacomazzi, Gabriella Saddemi