Sciweavers

503 search results - page 79 / 101
» Real-time Property Preservation in Approximations of Timed S...
Sort
View
ICALP
2010
Springer
14 years 12 days ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 8 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
ENTCS
2006
112views more  ENTCS 2006»
13 years 7 months ago
A Petri-Net Based Reflective Framework for the Evolution of Dynamic Systems
Nowadays, software evolution is a very hot topic. Many applications need to be updated or extended with new characteristics during their lifecycle. Software evolution is character...
Lorenzo Capra, Walter Cazzola
TFS
2008
116views more  TFS 2008»
13 years 7 months ago
Fuzzifying Allen's Temporal Interval Relations
When the time span of an event is imprecise, it can be represented by a fuzzy set, called a fuzzy time interval. In this paper, we propose a framework to represent, compute, and re...
Steven Schockaert, Martine De Cock, Etienne E. Ker...
ETRA
2010
ACM
178views Biometrics» more  ETRA 2010»
14 years 27 days ago
Biometric identification via an oculomotor plant mathematical model
There has been increased interest in reliable, non-intrusive methods of biometric identification due to the growing emphasis on security and increasing prevalence of identity thef...
Oleg V. Komogortsev, Sampath Jayarathna, Cecilia R...