Sciweavers

667 search results - page 128 / 134
» Computably Based Locally Compact Spaces
Sort
View
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
SIGGRAPH
2010
ACM
13 years 12 months ago
Manifold bootstrapping for SVBRDF capture
Manifold bootstrapping is a new method for data-driven modeling of real-world, spatially-varying reflectance, based on the idea that reflectance over a given material sample forms...
Yue Dong, Jiaping Wang, Xin Tong, John Snyder, Yan...
NIPS
2004
13 years 9 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 7 months ago
Linear Tabling Strategies and Optimizations
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...
Neng-Fa Zhou, Taisuke Sato, Yi-Dong Shen
CLUSTER
2004
IEEE
13 years 7 months ago
Resource Management for Ad-Hoc Wireless Networks with Cluster Organization
Boosted by technology advancements, government and commercial interest, ad-hoc wireless networks are emerging as a serious platform for distributed mission-critical applications. G...
Ionut Cardei, Srivatsan Varadarajan, Allalaghatta ...