Sciweavers

2745 search results - page 225 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
SI3D
2010
ACM
15 years 9 months ago
Real-time multi-agent path planning on arbitrary surfaces
Path planning is an active topic in the literature, and efficient navigation over non-planar surfaces is an open research question. In this work we present a novel technique for ...
Rafael P. Torchelsen, Luiz F. Scheidegger, Guilher...
ICIP
2007
IEEE
16 years 6 months ago
An Efficient Method for Compressed Sensing
Compressed sensing or compressive sampling (CS) has been receiving a lot of interest as a promising method for signal recovery and sampling. CS problems can be cast as convex prob...
Seung-Jean Kim, Kwangmoo Koh, Michael Lustig, Step...
KDD
2000
ACM
110views Data Mining» more  KDD 2000»
15 years 8 months ago
An empirical analysis of techniques for constructing and searching k-dimensional trees
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
Douglas A. Talbert, Douglas H. Fisher
ANOR
2008
93views more  ANOR 2008»
15 years 4 months ago
Pruning in column generation for service vehicle dispatching
Abstract Column generation techniques have become a widely used technique to successfully solve large (integer) linear programs. One of the keys to obtaining a practically efficien...
Stephan Westphal, Sven Oliver Krumke

Publication
184views
17 years 2 months ago
Design and Evaluation of Feedback Consolidation for ABR Point-to-Multipoint Connections in ATM Networks
The available bit rate (ABR) service is proposed to transport data traffic in asynchronous transfer mode (ATM) networks. ABR is unique because the network switches can indicate to ...
Sonia Fahmy, Raj Jain, Rohit Goyal, Bobby Vandalor...