Sciweavers

Share
APNOMS
2007
Springer
9 years 7 months ago
Scheduling Management in Wireless Mesh Networks
We propose a greedy algorithm to investigate the problem of how to schedule of a set of feasible transmissions under physical interference model. We also consider the fairness in s...
Nguyen H. Tran, Choong Seon Hong
ACCV
2007
Springer
9 years 7 months ago
Task Scheduling in Large Camera Networks
Camera networks are increasingly being deployed for security. In most of these camera networks, video sequences are captured, transmitted and archived continuously from all cameras...
Ser-Nam Lim, Larry S. Davis, Anurag Mittal
ICDM
2007
IEEE
143views Data Mining» more  ICDM 2007»
9 years 7 months ago
Bit Sequences and Biclustering of Text Documents
We propose a new technique for clustering of text documents that relies on a biclustering structure constructed on terms and documents. Our approach makes use of a greedy algorith...
Selim Mimaroglu, Kuniaki Uehara
GLOBECOM
2007
IEEE
9 years 7 months ago
Multiconstrained QoS Routing: Greedy is Good
— A fundamental problem in quality-of-service (QoS) routing is to find a path connecting a source node to a destination node that satisfies K ≥ 2 additive QoS constraints. Th...
Guoliang Xue, Weiyi Zhang
CEC
2007
IEEE
9 years 7 months ago
Greedy transformation of evolutionary algorithm search spaces for scheduling problems
— Many scheduling algorithms search the space of possible solutions (schedules), but some instead search the space of permutations of the set of jobs, employing a greedy algorith...
David Joslin, Justin Collins
ACIVS
2008
Springer
9 years 7 months ago
Sub-optimal Camera Selection in Practical Vision Networks through Shape Approximation
Within a camera network, the contribution of a camera to the observations of a scene depends on its viewpoint and on the scene configuration. This is a dynamic property, as the sc...
Huang Lee, Linda Tessens, Marleen Morbée, H...
ICRA
2008
IEEE
205views Robotics» more  ICRA 2008»
9 years 7 months ago
Minimum time point assignment for coverage by two constrained robots
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
TAMC
2009
Springer
9 years 8 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens
INFOCOM
2009
IEEE
9 years 8 months ago
Minimizing the Cost of Mine Selection Via Sensor Networks
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
Changlei Liu, Guohong Cao
DCC
2004
IEEE
10 years 29 days ago
An Approximation to the Greedy Algorithm for Differential Compression of Very Large Files
We present a new differential compression algorithm that combines the hash value techniques and suffix array techniques of previous work. Differential compression refers to encodi...
Ramesh C. Agarwal, Suchitra Amalapurapu, Shaili Ja...
books