Sciweavers

845 search results - page 22 / 169
» Complexity Dimensions and Learnability
Sort
View
TSP
2010
13 years 4 months ago
Low-complexity decoding via reduced dimension maximum-likelihood search
In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which...
Jun Won Choi, Byonghyo Shim, Andrew C. Singer, Nam...
GD
2005
Springer
14 years 3 months ago
Drawing Clustered Graphs in Three Dimensions
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
Joshua Wing Kei Ho, Seok-Hee Hong
APWEB
2010
Springer
14 years 1 months ago
Computing Large Skylines over Few Dimensions: The Curse of Anti-correlation
The skyline of a set P of multi-dimensional points (tuples) consists of those points in P for which no clearly better point in P exists, using component-wise comparison on domains ...
Henning Köhler, Jing Yang
CCGRID
2010
IEEE
13 years 10 months ago
High Performance Dimension Reduction and Visualization for Large High-Dimensional Data Analysis
Abstract--Large high dimension datasets are of growing importance in many fields and it is important to be able to visualize them for understanding the results of data mining appro...
Jong Youl Choi, Seung-Hee Bae, Xiaohong Qiu, Geoff...
CACM
2010
104views more  CACM 2010»
13 years 9 months ago
Faster dimension reduction
Data represented geometrically in high-dimensional vector spaces can be found in many applications. Images and videos, are often represented by assigning a dimension for every pix...
Nir Ailon, Bernard Chazelle