Sciweavers

3575 search results - page 332 / 715
» Structured motifs search
Sort
View
UAI
2001
15 years 8 months ago
Improved learning of Bayesian networks
The search space of Bayesian Network structures is usually defined as Acyclic Directed Graphs (DAGs) and the search is done by local transformations of DAGs. But the space of Baye...
Tomás Kocka, Robert Castelo
AAAI
1990
15 years 8 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih
CIKM
2009
Springer
15 years 8 months ago
Retrieval experiments using pseudo-desktop collections
Desktop search is an important part of personal information management (PIM). However, research in this area has been limited by the lack of shareable test collections, making cum...
Jinyoung Kim, W. Bruce Croft
CORR
2011
Springer
160views Education» more  CORR 2011»
15 years 1 months ago
When is social computation better than the sum of its parts?
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...
CIKM
2011
Springer
14 years 6 months ago
Coreference aware web object retrieval
As user demands become increasingly sophisticated, search engines today are competing in more than just returning document results from the Web. One area of competition is providi...
Jeffrey Dalton, Roi Blanco, Peter Mika