Sciweavers

13306 search results - page 395 / 2662
» Theoretical Computer Science
Sort
View
STACS
2005
Springer
16 years 9 days ago
How Common Can Be Universality for Cellular Automata?
Abstract. We address the problem of the density of intrinsically universal cellular automata among cellular automata or a subclass of cellular automata. We show that captive cellul...
Guillaume Theyssier
GI
2004
Springer
16 years 6 days ago
Ontology based Recruitment Process
: In our research we explore the benefits resulting from the application of Semantic Web technologies in the recruitment domain. We use currently available standards and classifi...
Malgorzata Mochol, Radoslaw Oldakowski, Ralf Heese
RANDOM
2001
Springer
15 years 11 months ago
On Euclidean Embeddings and Bandwidth Minimization
We study Euclidean embeddings of Euclidean metrics and present the following four results: (1) an O(log3 n √ log log n) approximation for minimum bandwidth in conjunction with a ...
John Dunagan, Santosh Vempala
FOCS
2000
IEEE
15 years 11 months ago
Clustering Data Streams
The data stream model has recently attracted attention for its applicability to numerous types of data, including telephone records, web documents and clickstreams. For analysis o...
Sudipto Guha, Nina Mishra, Rajeev Motwani, Liadan ...
225
Voted
RTA
1997
Springer
15 years 11 months ago
Solving Linear Diophantine Equations Using the Geometric Structure of the Solution Space
In the development of algorithms for finding the minimal solutions of systems of linear Diophantine equations, little use has been made (to our knowledge) of the results by Stanle...
Ana Paula Tomás, Miguel Filgueiras