Sciweavers

5981 search results - page 231 / 1197
» time 2006
Sort
View
IPL
2002
86views more  IPL 2002»
15 years 6 months ago
A polynomial algorithm for lot-size scheduling of two type tasks
We study the problem of scheduling unit time tasks of two types on m parallel identical machines. For each type, given numbers of tasks are required to be completed by the specifi...
Mikhail Y. Kovalyov, Marcus Pattloch, Günter ...
SIGIR
2006
ACM
16 years 13 days ago
Enhancing topic tracking with temporal information
In this paper, we propose a new strategy with time granularity reasoning for utilizing temporal information in topic tracking. Compared with previous ones, our work has four disti...
Baoli Li, Wenjie Li, Qin Lu
ECCC
2006
70views more  ECCC 2006»
15 years 6 months ago
Finding a Heaviest Triangle is not Harder than Matrix Multiplication
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
Artur Czumaj, Andrzej Lingas
PUC
2002
98views more  PUC 2002»
15 years 6 months ago
A User-Centered Location Model
: This paper discusses the user-centered location model used in comMotion. In this context, the location model refers to a set of learned places (destinations), which coincide to a...
Natalia Marmasse, Chris Schmandt
IJCNN
2006
IEEE
16 years 16 days ago
Pattern Selection for Support Vector Regression based on Sparseness and Variability
— Support Vector Machine has been well received in machine learning community with its theoretical as well as practical value. However, since its training time complexity is cubi...
Jiyoung Sun, Sungzoon Cho