Sciweavers

503 search results - page 61 / 101
» Two Algorithms for the Minimum Enclosing Ball Problem
Sort
View
ICIP
2009
IEEE
15 years 1 months ago
Face identification using linear regression
In this paper we present a novel approach of face identification by formulating the pattern recognition problem in terms of linear regression. Using a fundamental concept that pat...
Imran Naseem, Roberto Togneri, Mohammed Bennamoun
CCS
2009
ACM
16 years 4 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
JPDC
2006
148views more  JPDC 2006»
15 years 3 months ago
Efficient algorithm for placing a given number of base stations to cover a convex region
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhaban...
124
Voted
TCAD
2002
93views more  TCAD 2002»
15 years 3 months ago
Hierarchical buffered routing tree generation
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
Amir H. Salek, Jinan Lou, Massoud Pedram
113
Voted
BROADNETS
2007
IEEE
15 years 9 months ago
On energy aware routing in wireless networks
—Online energy aware routing in wireless networks is the problem of finding energy efficient routes that maximize the network lifetime without the knowledge of future message flo...
Aravind B. Mohanoor, Sridhar Radhakrishnan, Venkat...