Sciweavers

5622 search results - page 866 / 1125
» Solving architectural modelling problems using knowledge
Sort
View
ECCC
2011
202views ECommerce» more  ECCC 2011»
14 years 11 months ago
New strong direct product results in communication complexity
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
Rahul Jain
ICASSP
2008
IEEE
15 years 11 months ago
Unsupervised optimal phoneme segmentation: Objectives, algorithm and comparisons
Phoneme segmentation is a fundamental problem in many speech recognition and synthesis studies. Unsupervised phoneme segmentation assumes no knowledge on linguistic contents and a...
Yu Qiao, Naoya Shimomura, Nobuaki Minematsu
IROS
2008
IEEE
144views Robotics» more  IROS 2008»
15 years 11 months ago
Learning nonparametric policies by imitation
— A long cherished goal in artificial intelligence has been the ability to endow a robot with the capacity to learn and generalize skills from watching a human teacher. Such an ...
David B. Grimes, Rajesh P. N. Rao
172
Voted
CONSTRAINTS
2008
182views more  CONSTRAINTS 2008»
15 years 4 months ago
Constraint Programming in Structural Bioinformatics
Bioinformatics aims at applying computer science methods to the wealth of data collected in a variety of experiments in life sciences (e.g. cell and molecular biology, biochemistry...
Pedro Barahona, Ludwig Krippahl
PODC
2004
ACM
15 years 10 months ago
Group membership: a novel approach and the first single-round algorithm
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
Roger I. Khazan