Sciweavers

1257 search results - page 175 / 252
» A generalization of Euler's constant
Sort
View
ORDER
2008
61views more  ORDER 2008»
13 years 9 months ago
Partitioning Posets
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
Viresh Patel
IJCSA
2007
143views more  IJCSA 2007»
13 years 9 months ago
Incremental Trade-Off Management for Preference-Based Queries
Preference-based queries often referred to as skyline queries play an important role in cooperative query processing. However, their prohibitive result sizes pose a severe challen...
Wolf-Tilo Balke, Ulrich Güntzer, Christoph Lo...
SIGIR
2008
ACM
13 years 9 months ago
Bilingual topic aspect classification with a few training examples
This paper explores topic aspect (i.e., subtopic or facet) classification for English and Chinese collections. The evaluation model assumes a bilingual user who has found document...
Yejun Wu, Douglas W. Oard
SAC
2006
ACM
13 years 9 months ago
Challenges in the compilation of a domain specific language for dynamic programming
Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specifi...
Robert Giegerich, Peter Steffen
TIT
2008
119views more  TIT 2008»
13 years 8 months ago
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
We address the question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time. We consider a simple distributed sched...
Prasanna Chaporkar, Koushik Kar, Xiang Luo, Saswat...