Sciweavers

1701 search results - page 178 / 341
» Computer Science and State Machines
Sort
View
68
Voted
STACS
2007
Springer
15 years 4 months ago
On the Complexity of Unary Tiling-Recognizable Picture Languages
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
Alberto Bertoni, Massimiliano Goldwurm, Violetta L...
90
Voted
JMLR
2010
119views more  JMLR 2010»
14 years 5 months ago
The Coding Divergence for Measuring the Complexity of Separating Two Sets
In this paper we integrate two essential processes, discretization of continuous data and learning of a model that explains them, towards fully computational machine learning from...
Mahito Sugiyama, Akihiro Yamamoto
75
Voted
CSCW
2006
ACM
15 years 4 months ago
What goes around comes around: an analysis of del.icio.us as social space
An emergent class of web applications blurs the boundary between single user application and online public space. Recently popular web applications like del.icio.us help manage in...
Kathy J. Lee
105
Voted
ENC
2004
IEEE
15 years 2 months ago
Feature Selection for Visual Gesture Recognition Using Hidden Markov Models
Hidden Markov models have become the preferred technique for visual recognition of human gestures. However, the recognition rate depends on the set of visual features used, and al...
José Antonio Montero, Luis Enrique Sucar
99
Voted
MFCS
2004
Springer
15 years 3 months ago
Optimal Preemptive Scheduling for General Target Functions
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
Leah Epstein, Tamir Tassa