Sciweavers

2297 search results - page 266 / 460
» An Algorithm for Computing the Integral Closure
Sort
View
ICML
2005
IEEE
16 years 5 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
SIGMOD
2005
ACM
128views Database» more  SIGMOD 2005»
16 years 4 months ago
Privacy Preserving OLAP
We present techniques for privacy-preserving computation of multidimensional aggregates on data partitioned across multiple clients. Data from different clients is perturbed (rand...
Rakesh Agrawal, Ramakrishnan Srikant, Dilys Thomas
CP
2009
Springer
15 years 11 months ago
Dialectic Search
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
Serdar Kadioglu, Meinolf Sellmann
WCNC
2008
IEEE
15 years 11 months ago
An End-to-End Measurement-Based Admission Control Policy for VoIP over Wireless Networks
—in this paper, we present a new policy for admitting Voice over IP (VoIP) sessions over wireless networks. Our proposed policy receives the admission information advertised by t...
Ala F. Khalifeh
ADBIS
2008
Springer
142views Database» more  ADBIS 2008»
15 years 11 months ago
Evaluating Performance and Quality of XML-Based Similarity Joins
A similarity join correlating fragments in XML documents, which are similar in structure and content, can be used as the core algorithm to support data cleaning and data integratio...
Leonardo Ribeiro, Theo Härder