Sciweavers

2826 search results - page 368 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
16 years 6 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...
BMCBI
2006
121views more  BMCBI 2006»
15 years 6 months ago
Splice site identification using probabilistic parameters and SVM classification
Background: Recent advances and automation in DNA sequencing technology has created a vast amount of DNA sequence data. This increasing growth of sequence data demands better and ...
A. K. M. A. Baten, Bill C. H. Chang, Saman K. Halg...
DAC
1999
ACM
16 years 7 months ago
Behavioral Synthesis Techniques for Intellectual Property Protection
? The economic viability of the reusable core-based design paradigm depends on the development of techniques for intellectual property protection. We introduce the first dynamic wa...
Inki Hong, Miodrag Potkonjak
ESORICS
2005
Springer
16 years 4 days ago
Privacy Preserving Clustering
The freedom and transparency of information flow on the Internet has heightened concerns of privacy. Given a set of data items, clustering algorithms group similar items together...
Somesh Jha, Louis Kruger, Patrick McDaniel
WG
2010
Springer
15 years 5 months ago
Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlo...