Sciweavers

5169 search results - page 543 / 1034
» Locality approximation using time
Sort
View
225
Voted
ICASSP
2011
IEEE
14 years 11 months ago
Global convergence of independent component analysis based on semidefinite programming relaxation
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
Shotaro Akaho, Jun Fujiki
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
16 years 1 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
ICML
2004
IEEE
16 years 8 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
SIGCOMM
1994
ACM
15 years 11 months ago
Improved Algorithms for Synchronizing Computer Network Clocks
The Network Time Protocol (NTP) is widely deployed in the Internet to synchronize computer clocks to each other and to international standards via telephone modem, radio and satel...
David L. Mills
FUZZIEEE
2007
IEEE
16 years 1 months ago
Adaptive Optimization of the Number of Clusters in Fuzzy Clustering
In this paper, we present a local, adaptive optimization scheme for adjusting the number of clusters in fuzzy C-means clustering. This method is especially motivated by online app...
Jürgen Beringer, Eyke Hüllermeier