Sciweavers

4171 search results - page 731 / 835
» Choice numbers of graphs
Sort
View
ICML
2007
IEEE
16 years 7 months ago
Learning distance function by coding similarity
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
Aharon Bar-Hillel, Daphna Weinshall
ICML
2007
IEEE
16 years 7 months ago
Efficient inference with cardinality-based clique potentials
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi
SIGSOFT
2006
ACM
16 years 7 months ago
Lightweight extraction of syntactic specifications
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
Mana Taghdiri, Robert Seater, Daniel Jackson
ICDT
2009
ACM
198views Database» more  ICDT 2009»
16 years 7 months ago
Consistent query answering under primary keys: a characterization of tractable queries
This article deals with consistent query answering to conjunctive queries under primary key constraints. The repairs of an inconsistent database db are obtained by selecting a max...
Jef Wijsen
WWW
2007
ACM
16 years 7 months ago
Summarizing email conversations with clue words
Accessing an ever increasing number of emails, possibly on small mobile devices, has become a major problem for many users. Email summarization is a promising way to solve this pr...
Giuseppe Carenini, Raymond T. Ng, Xiaodong Zhou