Sciweavers

5115 search results - page 531 / 1023
» On Randomized Lanczos Algorithms
Sort
View
ALT
2007
Springer
16 years 3 months ago
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
Lev Reyzin, Nikhil Srivastava
ICRA
2009
IEEE
169views Robotics» more  ICRA 2009»
16 years 1 months ago
Manipulation planning with Workspace Goal Regions
— We present an approach to path planning for manipulators that uses Workspace Goal Regions (WGRs) to specify goal end-effector poses. Instead of specifying a discrete set of goa...
Dmitry Berenson, Siddhartha S. Srinivasa, Dave Fer...
143
Voted
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
16 years 1 months ago
3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit
The study of hashing is closely related to the analysis of balls and bins; items are hashed to memory locations much as balls are thrown into bins. In particular, Azar et. al. [2] ...
Eric Lehman, Rina Panigrahy
162
Voted
CCGRID
2007
IEEE
16 years 1 months ago
Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research
While a grid represents a computing infrastructure for cross domain sharing of computational resources, the cyberinfrastructure, proposed by the US NSF Blue – Ribbon advisory pa...
Jie Yin, Junwei Cao, Yuexuan Wang, Lianchen Liu, C...
COMSWARE
2007
IEEE
16 years 1 months ago
Survivable Routing in WDM Weighted Networks
: In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains conne...
Debasis Mandal, Satyajit Nath, Bivas Mitra