5055 search results - page 329 / 1011 » Relative Timing |
192
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
A k-frugal colouring of a graph G is a proper colouring of the vertices of G such that no colour appears more than k times in the neighbourhood of a vertex. This type of colouring...
150
click to vote
JC
2006
15 years 7 months ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
180
click to vote
JMLR
2006
15 years 7 months ago
2006
We give a review of various aspects of boosting, clarifying the issues through a few simple results, and relate our work and that of others to the minimax paradigm of statistics. ...
168
click to vote
FTHCI
2007
15 years 7 months ago
2007
The purpose of this article is twofold. First, we summarize research on the topic of privacy in Human–Computer Interaction (HCI), outlining current approaches, results, and tren...
199
click to vote
GRAMMARS
2000
15 years 7 months ago
2000
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...