Sciweavers

14518 search results - page 2475 / 2904
» Two Problems for Sophistication
Sort
View
ASIACRYPT
2009
Springer
16 years 1 months ago
Secure Multi-party Computation Minimizing Online Rounds
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
Seung Geol Choi, Ariel Elbaz, Tal Malkin, Moti Yun...
CIVR
2009
Springer
212views Image Analysis» more  CIVR 2009»
16 years 1 months ago
Video copy detection by fast sequence matching
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
Mei-Chen Yeh, Kwang-Ting Cheng
ESWS
2009
Springer
16 years 1 months ago
Evolva: A Comprehensive Approach to Ontology Evolution
Ontology evolution is increasingly gaining momentum in the area of Semantic Web research. Current approaches target the evolution in terms of either content, or change management, ...
Fouad Zablith
PKDD
2009
Springer
134views Data Mining» more  PKDD 2009»
16 years 1 months ago
Mining Graph Evolution Rules
In this paper we introduce graph-evolution rules, a novel type of frequency-based pattern that describe the evolution of large networks over time, at a local level. Given a sequenc...
Michele Berlingerio, Francesco Bonchi, Björn ...
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
16 years 1 months ago
Non-clairvoyant Scheduling Games
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
Christoph Dürr, Nguyen Kim Thang
« Prev « First page 2475 / 2904 Last » Next »