Sciweavers

2563 search results - page 219 / 513
» Phenomenology, Representations and Complexity
Sort
View
ICML
1999
IEEE
16 years 8 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 7 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
EDBT
2006
ACM
116views Database» more  EDBT 2006»
16 years 7 months ago
VICO: Visualizing Connected Object Orderings
In modern databases, complex objects like multimedia data, proteins or text objects can be modeled in a variety of representations and can be decomposed into multiple instances of ...
Stefan Brecheisen, Hans-Peter Kriegel, Matthias Sc...
ICIAP
2007
ACM
16 years 7 months ago
Generalization in Holistic versus Analytic Processing of Faces
The distinction between holistic and analytical (or feature-based) approaches to face recognition is widely held to be an important dimension of face recognition research. Holisti...
Manuele Bicego, Albert Ali Salah, Enrico Grosso, M...
ICSE
2004
IEEE-ACM
16 years 7 months ago
Unifying Artifacts and Activities in a Visual Tool for Distributed Software Development Teams
In large projects, software developers struggle with two sources of complexity ? the complexity of the code itself, and the complexity of the process of producing it. Both of thes...
Jon Froehlich, Paul Dourish