Sciweavers

380 search results - page 32 / 76
» A Categorical Setting for Lower Complexity
Sort
View
71
Voted
DEBU
2010
147views more  DEBU 2010»
14 years 9 months ago
Indoor - A New Data Management Frontier
Much research has been conducted on the management of outdoor moving objects. In contrast, relatively little research has been conducted on indoor moving objects. The indoor setti...
Christian S. Jensen, Hua Lu, Bin Yang 0002
ECAI
2006
Springer
15 years 1 months ago
Verifying Interlevel Relations Within Multi-Agent Systems
An approach to handle the complex dynamics of a multi-agent system is based on distinguishing aggregation levels by structuring the system into parts or components. The behavior of...
Alexei Sharpanskykh, Jan Treur
125
Voted
FOCS
2009
IEEE
15 years 4 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
ICML
2007
IEEE
15 years 10 months ago
A fast linear separability test by projection of positive points on subspaces
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
A. P. Yogananda, M. Narasimha Murty, Lakshmi Gopal
APAL
2007
111views more  APAL 2007»
14 years 9 months ago
A coverage construction of the reals and the irrationals
I modify the standard coverage construction of the reals to obtain the irrationals. However, this causes a jump in ordinal complexity from ω + 1 to Ω. The coverage technique ha...
Harold Simmons