Sciweavers

25041 search results - page 4368 / 5009
» Algorithms for Clustering Data
Sort
View
WWW
2010
ACM
16 years 9 days ago
FormSys: form-processing web services
In this paper we present FormSys, a Web-based system that service-enables form documents. It offers two main services: filling in forms based on Web services’ incoming SOAP me...
Ingo M. Weber, Hye-Young Paik, Boualem Benatallah,...
CF
2010
ACM
16 years 8 days ago
Variant-based competitive parallel execution of sequential programs
Competitive parallel execution (CPE) is a simple yet attractive technique to improve the performance of sequential programs on multi-core and multi-processor systems. A sequential...
Oliver Trachsel, Thomas R. Gross
ICDE
2002
IEEE
181views Database» more  ICDE 2002»
16 years 4 days ago
YFilter: Efficient and Scalable Filtering of XML Documents
Soon, much of the data exchanged over the Internet will be encoded in XML, allowing for sophisticated filtering and content-based routing. We have built a filtering engine called ...
Yanlei Diao, Peter M. Fischer, Michael J. Franklin...
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
16 years 5 hour 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...
CCA
2009
Springer
15 years 11 months ago
From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interv
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
Vladik Kreinovich
« Prev « First page 4368 / 5009 Last » Next »