Sciweavers

1458 search results - page 127 / 292
» The sequentially realizable functionals
Sort
View
143
Voted
JUCS
2002
116views more  JUCS 2002»
15 years 3 months ago
Design for All as a Challenge for Hypermedia Engineering
: Design for All is an important challenge for hypermedia engineering. We analyze this challenge and show that it is necessary to find a way of describing partially designed hyperm...
Volker Mattick
131
Voted
QUESTA
2007
117views more  QUESTA 2007»
15 years 3 months ago
Analyzing a degenerate buffer with general inter-arrival and service times in discrete time
We present the queueing analysis of a degenerate buffer having access to a single server. This system cannot realize any given delay, but only values that are an integer multiple ...
Wouter Rogiest, Koenraad Laevens, Joris Walraevens...
138
Voted
JMLR
2011
167views more  JMLR 2011»
14 years 10 months ago
Logistic Stick-Breaking Process
A logistic stick-breaking process (LSBP) is proposed for non-parametric clustering of general spatially- or temporally-dependent data, imposing the belief that proximate data are ...
Lu Ren, Lan Du, Lawrence Carin, David B. Dunson
117
Voted
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
15 years 9 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber
132
Voted
KDD
2004
ACM
163views Data Mining» more  KDD 2004»
16 years 4 months ago
Exploiting dictionaries in named entity extraction: combining semi-Markov extraction processes and data integration methods
We consider the problem of improving named entity recognition (NER) systems by using external dictionaries--more specifically, the problem of extending state-of-the-art NER system...
William W. Cohen, Sunita Sarawagi