Sciweavers

2403 search results - page 181 / 481
» Optimal Randomized RANSAC
Sort
View
112
Voted
COGSCI
2010
108views more  COGSCI 2010»
15 years 3 months ago
Do Grammars Minimize Dependency Length?
A well-established principle of language is that there is a preference for closely related words to be close together in the sentence. This can be expressed as a preference for de...
Daniel Gildea, David Temperley
63
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Multicast transmit beamforming using a randomize-in-time strategy
Recently there has been much interest in using transmit beamforming to provide multi-antenna physical-layer multicasting. A state of the art in this context is the semidefinite r...
Sissi X. Wu, Wing-Kin Ma
113
Voted
ICDT
2005
ACM
131views Database» more  ICDT 2005»
15 years 9 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
BIOINFORMATICS
2005
152views more  BIOINFORMATICS 2005»
15 years 3 months ago
Intervention in context-sensitive probabilistic Boolean networks
Motivation: Intervention in a gene regulatory network is used to help it avoid undesirable states, such as those associated with a disease. Several types of intervention have been...
Ranadip Pal, Aniruddha Datta, Michael L. Bittner, ...
181
Voted
JMLR
2012
13 years 6 months ago
Beyond Logarithmic Bounds in Online Learning
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
Francesco Orabona, Nicolò Cesa-Bianchi, Cla...