Sciweavers

5350 search results - page 311 / 1070
» Space and time in eco-ontologies
Sort
View
WALCOM
2007
IEEE
82views Algorithms» more  WALCOM 2007»
15 years 8 months ago
Methods for Searching Mutual Visible-Intervals on Moving Object
Abstract. Computing visible information, such as a visible surface determination, is a significant problem and has been mainly studied in the fields of computational geometry and...
Yoshiyuki Kusakari, Yuta Sugimoto, Junichi Notoya,...
CORR
2010
Springer
173views Education» more  CORR 2010»
15 years 6 months ago
CONCISE: Compressed 'n' Composable Integer Set
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
Alessandro Colantonio, Roberto Di Pietro
JUCS
2008
180views more  JUCS 2008»
15 years 6 months ago
The APS Framework For Incremental Learning of Software Agents
Abstract: Adaptive behavior and learning are required of software agents in many application domains. At the same time agents are often supposed to be resource-bounded systems, whi...
Damian Dudek
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 9 months ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
15 years 8 months ago
Suffix Arrays: A New Method for On-Line String Searches
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
Udi Manber, Gene Myers