Sciweavers

1964 search results - page 364 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
IMC
2007
ACM
13 years 9 months ago
Learning network structure from passive measurements
The ability to discover network organization, whether in the form of explicit topology reconstruction or as embeddings that approximate topological distance, is a valuable tool. T...
Brian Eriksson, Paul Barford, Robert Nowak, Mark C...
VLDB
2007
ACM
126views Database» more  VLDB 2007»
14 years 8 months ago
Querying Complex Structured Databases
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
Cong Yu, H. V. Jagadish
NIXDORF
1992
116views Hardware» more  NIXDORF 1992»
13 years 11 months ago
Programmable Active Memories: A Performance Assessment
We present some quantitative performance measurements for the computing power of Programmable Active Memories (PAM), as introduced by [2]. Based on Field Programmable Gate Array (...
Patrice Bertin, Didier Roncin, Jean Vuillemin
PR
2006
141views more  PR 2006»
13 years 7 months ago
Relaxational metric adaptation and its application to semi-supervised clustering and content-based image retrieval
The performance of many supervised and unsupervised learning algorithms is very sensitive to the choice of an appropriate distance metric. Previous work in metric learning and ada...
Hong Chang, Dit-Yan Yeung, William K. Cheung
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
14 years 8 months ago
Detecting research topics via the correlation between graphs and texts
In this paper we address the problem of detecting topics in large-scale linked document collections. Recently, topic detection has become a very active area of research due to its...
Yookyung Jo, Carl Lagoze, C. Lee Giles