Results 1  10
of
17,774
Regularization paths for generalized linear models via coordinate descent
, 2009
"... We develop fast algorithms for estimation of generalized linear models with convex penalties. The models include linear regression, twoclass logistic regression, and multinomial regression problems while the penalties include ℓ1 (the lasso), ℓ2 (ridge regression) and mixtures of the two (the elastic ..."
Abstract

Cited by 724 (15 self)
 Add to MetaCart
elastic net). The algorithms use cyclical coordinate descent, computed along a regularization path. The methods can handle large problems and can also deal efficiently with sparse features. In comparative timings we find that the new algorithms are considerably faster than competing methods.
Probabilistic Roadmaps for Path Planning in HighDimensional Configuration Spaces
 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION
, 1996
"... A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collisionfree configurations and whose edg ..."
Abstract

Cited by 1277 (120 self)
 Add to MetaCart
edges correspond to feasible paths between these configurations. These paths are computed using a simple and fast local planner. In the query phase, any given start and goal configurations of the robot are connected to two nodes of the roadmap; the roadmap is then searched for a path joining these two
Molecular Computation Of Solutions To Combinatorial Problems
, 1994
"... The tools of molecular biology are used to solve an instance of the directed Hamiltonian path problem. A small graph is encoded in molecules of DNA and the `operations' of the computation are performed with standard protocols and enzymes. This experiment demonstrates the feasibility of carrying ..."
Abstract

Cited by 773 (6 self)
 Add to MetaCart
The tools of molecular biology are used to solve an instance of the directed Hamiltonian path problem. A small graph is encoded in molecules of DNA and the `operations' of the computation are performed with standard protocols and enzymes. This experiment demonstrates the feasibility
Multiconstrained path computation for . . .
, 2011
"... Computing interdomain MultiProtocol Label Switching Traffic Engineering Label Switched Path (MPLSTE LSP) using the Path Computation Element (PCE) through a predetermined sequence of domains is quite straight. Each PCE, using the Backward Recursive PCEbased Computation (BRPC), knows who is the ne ..."
Abstract
 Add to MetaCart
Computing interdomain MultiProtocol Label Switching Traffic Engineering Label Switched Path (MPLSTE LSP) using the Path Computation Element (PCE) through a predetermined sequence of domains is quite straight. Each PCE, using the Backward Recursive PCEbased Computation (BRPC), knows who
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 560 (0 self)
 Add to MetaCart
required by earlier algorithms. First, the paper states the maximum flow problem, gives the FordFulkerson labeling method for its solution, and points out that an improper choice of flow augmenting paths can lead to severe computational difficulties. Then rules of choice that avoid these difficulties
A Bayesian computer vision system for modeling human interactions
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2000
"... We describe a realtime computer vision and machine learning system for modeling and recognizing human behaviors in a visual surveillance task [1]. The system is particularly concerned with detecting when interactions between people occur and classifying the type of interaction. Examples of interes ..."
Abstract

Cited by 538 (6 self)
 Add to MetaCart
We describe a realtime computer vision and machine learning system for modeling and recognizing human behaviors in a visual surveillance task [1]. The system is particularly concerned with detecting when interactions between people occur and classifying the type of interaction. Examples
Vogels, UNet: a userlevel network interface for parallel and distributed computing, in:
 Proceedings of the 15th ACM Symposium on Operating System Principles, ACM,
, 1995
"... Abstract The UNet communication architecture provides processes with a virtual view of a network device to enable userlevel access to highspeed communication devices. The architecture, implemented on standard workstations using offtheshelf ATM communication hardware, removes the kernel from th ..."
Abstract

Cited by 597 (17 self)
 Add to MetaCart
the communication path, while still providing full protection. The model presented by UNet allows for the construction of protocols at user level whose performance is only limited by the capabilities of network. The architecture is extremely flexible in the sense that traditional protocols like TCP and UDP
Constrained Shortest Path Computation
"... This paper proposes and solves aautonomy and kstops shortest path problems in large spatial databases. Given a source s and a destination d, anaautonomy query retrieves a sequence of data points connecting s and d, such that the distance between any two consecutive points in the path is not great ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
is not greater than a. Akstops query retrieves a sequence that contains exactly k intermediate data points. In both cases our aim is to compute the shortest path subject to these constraints. Assuming that the dataset is indexed by a datapartitioning method, the proposed techniques initially compute a sub
On the scalability of interdomain path computations
 In IFIP Networking 2014
, 2014
"... AbstractRecent research has considered various architectural approaches in which route determination occurs separately from forwarding. Such offers many advantages, but also brings a number of challenges, not least of which is scalability. In this paper we consider the problem of computing domain ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
level endtoend routes in the Internet. We describe a system architecture and a prototype route computation service that provides performance information along with paths. The results of our experiments, which involve updating billions of routes and serving thousands of requests per second, suggest
Synchronized Dependent Path Computations
, 2010
"... Use of the Synchronization VECtor (SVEC) List for ..."
Results 1  10
of
17,774