Sciweavers

3220 search results - page 640 / 644
» Constrained Graph Processes
Sort
View
104
Voted
EC
1998
112views ECommerce» more  EC 1998»
14 years 9 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley
PAMI
1998
84views more  PAMI 1998»
14 years 9 months ago
Intrinsic Dimensionality Estimation With Optimally Topology Preserving Maps
A new method for analyzing the intrinsic dimensionality (ID) of low dimensional manifolds in high dimensional feature spaces is presented. The basic idea is to rst extract a low-d...
Jörg Bruske, Gerald Sommer
SOSYM
2002
188views more  SOSYM 2002»
14 years 9 months ago
Extending the Unified Modeling Language for ontology development
Abstract. There is rapidly growing momentum for web enabled agents that reason about and dynamically integrate the appropriate knowledge and services at run-time. The dynamic integ...
Kenneth Baclawski, Mieczyslaw M. Kokar, Paul A. Ko...
PC
2007
161views Management» more  PC 2007»
14 years 9 months ago
High performance combinatorial algorithm design on the Cell Broadband Engine processor
The Sony–Toshiba–IBM Cell Broadband Engine (Cell/B.E.) is a heterogeneous multicore architecture that consists of a traditional microprocessor (PPE) with eight SIMD co-process...
David A. Bader, Virat Agarwal, Kamesh Madduri, Seu...
PVLDB
2010
82views more  PVLDB 2010»
14 years 8 months ago
Record Linkage with Uniqueness Constraints and Erroneous Values
Many data-management applications require integrating data from a variety of sources, where different sources may refer to the same real-world entity in different ways and some ma...
Songtao Guo, Xin Dong, Divesh Srivastava, Remi Zaj...