Sciweavers

2853 search results - page 60 / 571
» Finding related tables
Sort
View
ICDE
2008
IEEE
118views Database» more  ICDE 2008»
14 years 11 months ago
k-Anonymization Revisited
In this paper we introduce new notions of k-type anonymizations. Those notions achieve similar privacy goals as those aimed by Sweenie and Samarati when proposing the concept of k-...
Aristides Gionis, Arnon Mazza, Tamir Tassa
UAI
2004
13 years 11 months ago
On Finding Minimal w-cutset
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
Bozhena Bidyuk, Rina Dechter
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 10 months ago
The Complexity of Finding Reset Words in Finite Automata
We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word ha...
Jörg Olschewski, Michael Ummels
HICSS
2007
IEEE
121views Biometrics» more  HICSS 2007»
14 years 4 months ago
Theorizing in Information Systems Research: Some Preliminary Findings
Information systems (IS) research employs a wide range of theory, drawn from numerous disciplines. Over the course of the past three decades, the proliferation of theory has creat...
Brent Furneaux, Michael Wade, Hossam Ali-Hassan
ICMCS
2005
IEEE
123views Multimedia» more  ICMCS 2005»
14 years 3 months ago
Improved face finding in visually challenging environments
Finding faces in visually challenging environments is crucial to many applications, such as audio-visual automatic speech recognition, video indexing, person recognition, and vide...
Jintao Jiang, Gerasimos Potamianos, Giridharan Iye...