Sciweavers

103 search results - page 11 / 21
» A General Label Search to investigate classical graph search...
Sort
View
CIKM
2009
Springer
14 years 3 months ago
On domain similarity and effectiveness of adapting-to-rank
Adapting to rank address the the problem of insufficient domainspecific labeled training data in learning to rank. However, the initial study shows that adaptation is not always...
Keke Chen, Jing Bai, Srihari Reddy, Belle L. Tseng
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
14 years 3 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
ASIACRYPT
2010
Springer
13 years 7 months ago
Structured Encryption and Controlled Disclosure
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
Melissa Chase, Seny Kamara
IJCAI
1989
13 years 10 months ago
Constraint Satisfiability Algorithms for Interactive Student Scheduling
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
Ronen Feldman, Martin Charles Golumbic
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
14 years 1 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis