Sciweavers

2826 search results - page 434 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
ICNP
2005
IEEE
16 years 2 days ago
Shape Shifting Tries for Faster IP Route Lookup
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
Haoyu Song, Jonathan S. Turner, John W. Lockwood
AUSDM
2006
Springer
118views Data Mining» more  AUSDM 2006»
15 years 10 months ago
Efficiently Identifying Exploratory Rules' Significance
How to efficiently discard potentially uninteresting rules in exploratory rule discovery is one of the important research foci in data mining. Many researchers have presented algor...
Shiying Huang, Geoffrey I. Webb
EDBT
2009
ACM
131views Database» more  EDBT 2009»
15 years 9 months ago
Sample synopses for approximate answering of group-by queries
With the amount of data in current data warehouse databases growing steadily, random sampling is continuously gaining in importance. In particular, interactive analyses of large d...
Philipp Rösch, Wolfgang Lehner
BCSHCI
2007
15 years 8 months ago
Visualising Bluetooth interactions: combining the Arc diagram and DocuBurst techniques
Within the Bluetooth mobile space, overwhelmingly large sets of interaction and encounter data can very quickly be accumulated. This presents a challenge to gaining an understandi...
Daragh Byrne, Barry Lavelle, Gareth J. F. Jones, A...
COR
2008
164views more  COR 2008»
15 years 6 months ago
Observations in using parallel and sequential evolutionary algorithms for automatic software testing
In this paper we analyze the application of parallel and sequential evolutionary algorithms (EAs) to the automatic test data generation problem. The problem consists of automatica...
Enrique Alba, J. Francisco Chicano