Sciweavers

364 search results - page 34 / 73
» Computing Communities in Large Networks Using Random Walks
Sort
View
120
Voted
TSMC
2002
110views more  TSMC 2002»
15 years 2 months ago
Complexity reduction for "large image" processing
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...
Nikhil R. Pal, James C. Bezdek
136
Voted
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
15 years 4 months ago
Proximity Tracking on Time-Evolving Bipartite Graphs
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time...
Hanghang Tong, Spiros Papadimitriou, Philip S. Yu,...
118
Voted
BIOCOMP
2006
15 years 4 months ago
Finishing Repetitive Regions Automatically with Dupfinisher
Currently, the genome sequencing community is producing shotgun sequence data at a very high rate, but genome finishing is not keeping pace, even with the help from several automa...
Cliff Han, Patrick Chain
IDEAL
2010
Springer
15 years 1 months ago
Typed Linear Chain Conditional Random Fields and Their Application to Intrusion Detection
Intrusion detection in computer networks faces the problem of a large number of both false alarms and unrecognized attacks. To improve the precision of detection, various machine l...
Carsten Elfers, Mirko Horstmann, Karsten Sohr, Ott...
130
Voted
NIPS
2003
15 years 4 months ago
On the Concentration of Expectation and Approximate Inference in Layered Networks
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
XuanLong Nguyen, Michael I. Jordan