Sciweavers

14699 search results - page 2850 / 2940
» Complexity and Cognitive Computing
Sort
View
AGP
2010
IEEE
14 years 1 months ago
Constraint Logic Programming
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
Marco Gavanelli, Francesca Rossi
ISCA
2010
IEEE
210views Hardware» more  ISCA 2010»
14 years 1 months ago
An intra-chip free-space optical interconnect
Continued device scaling enables microprocessors and other systems-on-chip (SoCs) to increase their performance, functionality, and hence, complexity. Simultaneously, relentless s...
Jing Xue, Alok Garg, Berkehan Ciftcioglu, Jianyun ...
SSDBM
2010
IEEE
308views Database» more  SSDBM 2010»
14 years 1 months ago
Provenance Context Entity (PaCE): Scalable Provenance Tracking for Scientific RDF Data
The Resource Description Framework (RDF) format is being used by a large number of scientific applications to store and disseminate their datasets. The provenance information, desc...
Satya Sanket Sahoo, Olivier Bodenreider, Pascal Hi...
COMPGEOM
2010
ACM
14 years 1 months ago
Incidences in three dimensions and distinct distances in the plane
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
György Elekes, Micha Sharir
COMPGEOM
2010
ACM
14 years 1 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
« Prev « First page 2850 / 2940 Last » Next »