Sciweavers

1897 search results - page 373 / 380
» Early application identification
Sort
View
DKE
2008
79views more  DKE 2008»
13 years 10 months ago
Extracting k most important groups from data efficiently
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
Man Lung Yiu, Nikos Mamoulis, Vagelis Hristidis
BMCBI
2006
117views more  BMCBI 2006»
13 years 9 months ago
Gene Designer: a synthetic biology tool for constructing artificial DNA segments
Background: Direct synthesis of genes is rapidly becoming the most efficient way to make functional genetic constructs and enables applications such as codon optimization, RNAi re...
Alan Villalobos, Jon E. Ness, Claes Gustafsson, Je...
CCR
2006
122views more  CCR 2006»
13 years 9 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
ENTCS
2006
112views more  ENTCS 2006»
13 years 9 months ago
A Petri-Net Based Reflective Framework for the Evolution of Dynamic Systems
Nowadays, software evolution is a very hot topic. Many applications need to be updated or extended with new characteristics during their lifecycle. Software evolution is character...
Lorenzo Capra, Walter Cazzola
JUCS
2008
113views more  JUCS 2008»
13 years 9 months ago
What is Correctness of Security Protocols?
: As soon as major protocol flaws were discovered empirically -- a good luck that is not older than the early 1990s -- this title question came up to the world. It was soon realise...
Giampaolo Bella