Sciweavers

2104 search results - page 286 / 421
» Sorting with networks of data structures
Sort
View
JMLR
2008
230views more  JMLR 2008»
15 years 4 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...
3DPVT
2006
IEEE
167views Visualization» more  3DPVT 2006»
15 years 11 months ago
Hierarchical Representation of Virtual Cities for Progressive Transmission over Networks
Interactive network-based navigation over large urban environments raises difficult problems due to the size and complexity of these scenes. In this paper, we present a clientser...
Jérôme Royan, R. Balter, Christian Bo...
NIPS
2007
15 years 6 months ago
Sparse Feature Learning for Deep Belief Networks
Unsupervised learning algorithms aim to discover the structure hidden in the data, and to learn representations that are more suitable as input to a supervised machine than the ra...
Marc'Aurelio Ranzato, Y-Lan Boureau, Yann LeCun
154
Voted
JSAC
2006
163views more  JSAC 2006»
15 years 4 months ago
Fast and Scalable Pattern Matching for Network Intrusion Detection Systems
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packets....
Sarang Dharmapurikar, John W. Lockwood
DEBU
2010
180views more  DEBU 2010»
15 years 5 months ago
Searching RDF Graphs with SPARQL and Keywords
The proliferation of knowledge-sharing communities like Wikipedia and the advances in automated information extraction from Web pages enable the construction of large knowledge ba...
Shady Elbassuoni, Maya Ramanath, Ralf Schenkel, Ge...