Sciweavers

17329 search results - page 3092 / 3466
» Improved non-approximability results
Sort
View
PLDI
2004
ACM
16 years 7 days ago
Fast searches for effective optimization phase sequences
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
Prasad Kulkarni, Stephen Hines, Jason Hiser, David...
SAC
2004
ACM
16 years 7 days ago
Towards a flexible, process-oriented IT architecture for an integrated healthcare network
Healthcare information systems play an important role in improving healthcare quality. As providing healthcare increasingly changes from isolated treatment episodes towards a cont...
Mario Beyer, Klaus Kuhn, Christian Meiler, Stefan ...
SAC
2004
ACM
16 years 7 days ago
Dynamic on-demand updating of data in real-time database systems
The amount of data handled by real-time and embedded applications is increasing. Also, applications normally have constraints with respect to freshness and timeliness of the data ...
Thomas Gustafsson, Jörgen Hansson
SIGIR
2004
ACM
16 years 7 days ago
An effective approach to document retrieval via utilizing WordNet and recognizing phrases
Noun phrases in queries are identified and classified into four types: proper names, dictionary phrases, simple phrases and complex phrases. A document has a phrase if all content...
Shuang Liu, Fang Liu, Clement T. Yu, Weiyi Meng
CPM
2004
Springer
110views Combinatorics» more  CPM 2004»
16 years 6 days ago
On the k-Closest Substring and k-Consensus Pattern Problems
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: find k center strings c1, c2,...
Yishan Jiao, Jingyi Xu, Ming Li
« Prev « First page 3092 / 3466 Last » Next »