Sciweavers

1920 search results - page 84 / 384
» The Complexity of the A B C Problem
Sort
View
170
Voted
PRICAI
2010
Springer
15 years 4 months ago
Exploiting Symmetry in Relational Similarity for Ranking Relational Search Results
Relational search is a novel paradigm of search which focuses on the similarity between semantic relations. Given three words (A, B, C) as the query, a relational search engine ret...
Tomokazu Goto, Nguyen Tuan Duc, Danushka Bollegala...
LOGCOM
2008
94views more  LOGCOM 2008»
15 years 6 months ago
Preservation of Interpolation Features by Fibring
Fibring is a metalogical constructor that permits to combine different logics by operating on their deductive systems under certain natural restrictions, as for example that the t...
Walter Alexandre Carnielli, João Rasga, Cri...
JCSS
2008
120views more  JCSS 2008»
15 years 6 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
186
Voted
KDD
2007
ACM
153views Data Mining» more  KDD 2007»
16 years 6 months ago
Exploiting duality in summarization with deterministic guarantees
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
Panagiotis Karras, Dimitris Sacharidis, Nikos Mamo...
GECCO
2003
Springer
189views Optimization» more  GECCO 2003»
15 years 11 months ago
A Forest Representation for Evolutionary Algorithms Applied to Network Design
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
Alexandre C. B. Delbem, André Carlos Ponce ...