Sciweavers

262 search results - page 49 / 53
» Verifying Web Applications Using Bounded Model Checking
Sort
View
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 4 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
97
Voted
ACMICEC
2005
ACM
156views ECommerce» more  ACMICEC 2005»
15 years 5 months ago
Establishing and maintaining compatibility in service oriented business collaboration
Current composite web service development and management solutions, e.g. BPEL, do not cater for assessing and maintaining comparability of business partners during business collab...
Bart Orriëns, Jian Yang
OOPSLA
2007
Springer
15 years 5 months ago
The design and implementation of formal monitoring techniques
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Previous and related work has shown that runtime m...
Eric Bodden
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
15 years 6 months ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
15 years 11 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li