Sciweavers

50 search results - page 7 / 10
» Building Structure into Local Search for SAT
Sort
View
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 12 days ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
NIPS
2003
13 years 9 months ago
Online Learning via Global Feedback for Phrase Recognition
We present a system to recognize phrases based on perceptrons, and a global online learning algorithm to train them together. The recognition strategy applies learning in two laye...
Xavier Carreras, Lluís Màrquez
JUCS
2007
152views more  JUCS 2007»
13 years 7 months ago
The SEWASIE Network of Mediator Agents for Semantic Search
: Integration of heterogeneous information in the context of Internet becomes a key activity to enable a more organized and semantically meaningful access to data sources. As Inter...
Domenico Beneventano, Sonia Bergamaschi, Francesco...
AIRWEB
2007
Springer
14 years 1 months ago
Computing Trusted Authority Scores in Peer-to-Peer Web Search Networks
Peer-to-peer (P2P) networks have received great attention for sharing and searching information in large user communities. The open and anonymous nature of P2P networks is one of ...
Josiane Xavier Parreira, Debora Donato, Carlos Cas...
ECAI
2008
Springer
13 years 9 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...