Sciweavers

1632 search results - page 67 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
132
Voted
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
16 years 20 days ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
Hiroki Arimura, Takeaki Uno
140
Voted
FAW
2007
Springer
115views Algorithms» more  FAW 2007»
15 years 9 months ago
An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs
In this paper, we consider the recognition problem on a class of perfectly orderable graphs, namely, the HHD-free graphs, i.e., graphs that do not contain any induced subgraph iso...
Stavros D. Nikolopoulos, Leonidas Palios
127
Voted
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 9 months ago
Geometric particle swarm optimisation on binary and real spaces: from theory to practice
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
Cecilia Di Chio, Alberto Moraglio, Riccardo Poli
136
Voted
ECAI
2008
Springer
15 years 5 months ago
Author Identification Using a Tensor Space Representation
Author identification is a text categorization task with applications in intelligence, criminal law, computer forensics, etc. Usually, in such cases there is shortage of training t...
Spyridon Plakias, Efstathios Stamatatos
144
Voted
INFOCOM
2011
IEEE
14 years 7 months ago
Finite-horizon energy allocation and routing scheme in rechargeable sensor networks
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
Shengbo Chen, Prasun Sinha, Ness B. Shroff, Changh...