Sciweavers

4917 search results - page 934 / 984
» Software Engineering is Not Computer Science
Sort
View
WWW
2007
ACM
14 years 10 months ago
Answering bounded continuous search queries in the world wide web
Search queries applied to extract relevant information from the World Wide Web over a period of time may be denoted as continuous search queries. The improvement of continuous sea...
Dirk Kukulenz, Alexandros Ntoulas
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
14 years 10 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
VLDB
2004
ACM
161views Database» more  VLDB 2004»
14 years 10 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
ICWS
2009
IEEE
14 years 7 months ago
Service Supervision: Coordinating Web Services in Open Environment
ite Web service designed based on abstract Web services, which define only interfaces, allows an application developer to select services required for his application only by set...
Masahiro Tanaka, Toru Ishida, Yohei Murakami, Sato...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 4 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking