Sciweavers

24 search results - page 3 / 5
» A Coalgebraic Perspective on Minimization and Determinizatio...
Sort
View
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
14 years 5 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng
ICCV
2007
IEEE
14 years 7 months ago
Rotational Motion Deblurring of a Rigid Object from a Single Image
Most previous motion deblurring methods restore the degraded image assuming a shift-invariant linear blur filter. These methods are not applicable if the blur is caused by spatial...
Qi Shan, Wei Xiong, Jiaya Jia
ICAIL
2007
ACM
13 years 9 months ago
How to capture, model, and verify the knowledge of legal, security, and privacy experts: a pattern-based approach
Laws set requirements that force organizations to assess the security and privacy of their IT systems and impose the adoption of the implementation of minimal precautionary securi...
Luca Compagna, Paul El Khoury, Fabio Massacci, Res...
JUCS
2002
131views more  JUCS 2002»
13 years 5 months ago
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
Dana Cristofor, Dan A. Simovici
INFOCOM
2010
IEEE
13 years 3 months ago
Truthful Least-Priced-Path Routing in Opportunistic Spectrum Access Networks
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
Tao Shu, Marwan Krunz