CORR 2004 - PDF Preprint Papers

CORR 2004 Workshop on Service Oriented Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CORR-2004 Paper

click to vote

CORR
2004
Springer

229views Education» more CORR 2004»

Tsnnls: A solver for large sparse least squares problems with non-negative variables

13 years 11 months ago

Download www.cs.washington.edu

Jason Cantarella, Michael Piatek

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	229	Tsnnls: A solver for large sparse least squares problems with non-negative variables	claim
2	223	Better Foreground Segmentation Through Graph Cuts	claim
3	223	MultiNeuron - Neural Networks Simulator For Medical, Physiological, and Psychological Applications	claim
4	218	A Dynamic Clustering-Based Markov Model for Web Usage Mining	claim
5	208	Business Intelligence from Web Usage Mining	claim
6	196	Swarming around Shellfish Larvae	claim
7	195	Detecting User Engagement in Everyday Conversations	claim
8	191	Artificial Intelligence and Systems Theory: Applied to Cooperative Robots	claim
9	188	Technological networks and the spread of computer viruses	claim
10	180	Alchemi: A .NET-based Grid Computing Framework and its Integration into Global Grids	claim
11	180	Self-Organized Stigmergic Document Maps: Environment as a Mechanism for Context Learning	claim
12	177	Typestate Checking and Regular Graph Constraints	claim
13	176	The First-Order Theory of Sets with Cardinality Constraints is Decidable	claim
14	168	Estimating Genome Reversal Distance by Genetic Algorithm	claim
15	166	A Process Algebraic Approach to Concurrent and Distributed Quantum Computation: Operational Semantics	claim
16	162	Analysis of 802.11b MAC: A QoS, Fairness, and Performance Perspective	claim
17	153	Cauchy Annealing Schedule: An Annealing Schedule for Boltzmann Selection Scheme in Evolutionary Algorithms	claim
18	152	Non-negative matrix factorization with sparseness constraints	claim
19	151	The Infati Data	claim
20	151	Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version	claim
21	148	Supporting Bandwidth Guarantee and Mobility for Real-Time Applications on Wireless LANs	claim
22	147	Collaborative Storage Management In Sensor Networks	claim
23	147	Using Wireless Sensor Networks to Narrow the Gap between Low-Level Information and Context-Awareness	claim
24	146	Mining Frequent Itemsets from Secondary Memory	claim
25	146	ANTIDS: Self-Organized Ant-based Clustering Model for Intrusion Detection System	claim
26	144	Iterative Quantization Using Codes On Graphs	claim
27	144	The Google Similarity Distance	claim
28	143	An argumentative annotation schema for meeting discussions	claim
29	142	Global Grids and Software Toolkits: A Study of Four Grid Middleware Technologies	claim
30	142	Dynamic Localization Protocols for Mobile Sensor Networks	claim
31	142	Modeling and Validating Hybrid Systems Using VDM and Mathematica	claim
32	140	Integrating Defeasible Argumentation and Machine Learning Techniques	claim
33	140	Better algorithms for unfair metrical task systems and applications	claim
34	140	Capacity Analysis for Continuous Alphabet Channels with Side Information, Part II: MIMO Channels	claim
35	140	Checking modes of HAL programs	claim
36	139	Artificial Ant Colonies in Digital Image Habitats - A Mass Behaviour Effect Study on Pattern Recognition	claim
37	139	The Computational Power of Benenson Automata	claim
38	138	The Accelerated Euclidean Algorithm	claim
39	137	Implementation of Logical Functions in the Game of Life	claim
40	136	On Global Warming (Softening Global Constraints)	claim
41	136	Algorithms for weighted multi-tape automata	claim
42	136	Analysis and Visualization of Index Words from Audio Transcripts of Instructional Videos	claim
43	136	Automatic Generation of CHR Constraint Solvers	claim
44	133	Automatic Keyword Extraction from Spoken Text. A Comparison of two Lexical Resources: the EDR and WordNet	claim
45	133	Mathematical Analysis of Multi-Agent Systems	claim
46	133	Information theory, multivariate dependence, and genetic network inference	claim
47	130	Semantic Linking - a Context-Based Approach to Interactivity in Hypermedia	claim
48	130	On the role of MMSE estimation in approaching the information-theoretic limits of linear Gaussian channels: Shannon meets Wiener	claim
49	129	From Digital Television to Internet?	claim
50	129	Runtime Reconfiguration of J2EE Applications	claim
51	129	On Generalized Records and Spatial Conjunction in Role Logic	claim
52	128	Unsupervised Topic Adaptation for Lecture Speech Retrieval	claim
53	128	Specialization of Functional Logic Programs Based on Needed Narrowing	claim
54	128	Vector Symbolic Architectures answer Jackendoff's challenges for cognitive neuroscience	claim
55	127	Monitoring, Analyzing, and Controlling Internet-scale Systems with ACME	claim
56	126	Effects of Language Modeling on Speech-driven Question Answering	claim
57	126	WebotsTM: Professional Mobile Robot Simulation	claim
58	125	Traffic Accident Analysis Using Decision Trees and Neural Networks	claim
59	125	Word Sense Disambiguation by Web Mining for Word Co-occurrence Probabilities	claim
60	125	A Software Architecture for Automatic Deployment of CORBA Components Using Grid Technologies	claim
61	125	High-Level Networking With Mobile Code And First Order AND-Continuations	claim
62	124	On the existence of stable models of non-stratified logic programs	claim
63	123	Light types for polynomial time computation in lambda-calculus	claim
64	122	"In vivo" spam filtering: A challenge problem for data mining	claim
65	122	Evolution of a Subsumption Architecture Neurocontroller	claim
66	122	Simple Distributed Weighted Matchings	claim
67	121	Worst-Case Optimal Tree Layout in a Memory Hierarchy	claim
68	121	A measure of similarity between graph vertices	claim
69	121	An agent-based intelligent environmental monitoring system	claim
70	121	Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners	claim
71	120	Validating a Web Service Security Abstraction by Typing	claim
72	119	The Largest Compatible Subset Problem for Phylogenetic Data	claim
73	119	On Role Logic	claim
74	119	Exploring networks with traceroute-like probes: theory and simulations	claim
75	118	Understanding Search Trees via Statistical Physics	claim
76	118	Annotating Predicate-Argument Structure for a Parallel Treebank	claim
77	118	Application of the Double Metaphone Algorithm to Amharic Orthography	claim
78	118	Online Companion Caching	claim
79	118	All Maximal Independent Sets and Dynamic Dominance for Sparse Graphs	claim
80	117	Traffic-driven model of the World Wide Web graph	claim
81	117	Efficient dot product over word-size finite fields	claim
82	116	Static versus Dynamic Arbitrage Bounds on Multivariate Option Prices	claim
83	116	Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder	claim
84	115	An Algorithm for Quasi-Associative and Quasi-Markovian Rules of Combination in Information Fusion	claim
85	115	Bounds on the decoding complexity of punctured codes on graphs	claim
86	115	Jartege: a Tool for Random Generation of Unit Tests for Java Classes	claim
87	114	Hybrid Fuzzy-Linear Programming Approach for Multi Criteria Decision Making Problems	claim
88	114	Quantum Communication Cannot Simulate a Public Coin	claim
89	113	Pattern Reification as the Basis for Description-Driven Systems	claim
90	113	A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems	claim
91	113	RRL: A Rich Representation Language for the Description of Agent Behaviour in NECA	claim
92	113	An approach to membrane computing under inexactitude	claim
93	112	Source Coding with Fixed Lag Side Information	claim
94	112	A Framework for Creating Natural Language User Interfaces for Action-Based Applications	claim
95	112	Swarms on Continuous Data	claim
96	112	Clustering Techniques for Marbles Classification	claim
97	111	FLUX: A Logic Programming Method for Reasoning Agents	claim
98	111	Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard	claim
99	111	Coloring Meyniel graphs in linear time	claim
100	111	Layout of Graphs with Bounded Tree-Width	claim
101	111	Distance distribution of binary codes and the error probability of decoding	claim
102	111	Finding Approximate Palindromes in Strings Quickly and Simply	claim
103	111	Monotonicity Results for Coherent MIMO Rician Channels	claim
104	110	Evolving a Stigmergic Self-Organized Data-Mining	claim
105	110	Shannon Information and Kolmogorov Complexity	claim
106	110	On Modal Logics of Partial Recursive Functions	claim
107	110	On the Implicit and on the Artificial - Morphogenesis and Emergent Aesthetics in Autonomous Collective Systems	claim
108	108	Comparing Multi-Target Trackers on Different Force Unit Levels	claim
109	108	Pervasive Service Architecture for a Digital Business Ecosystem	claim
110	108	The lattice dimension of a graph	claim
111	108	Efficiency Enhancement of Probabilistic Model Building Genetic Algorithms	claim
112	107	Information Theory - The Bridge Connecting Bounded Rational Game Theory and Statistical Physics	claim
113	107	A Directed Threshold - Signature Scheme	claim
114	107	Security of public key cryptosystems based on Chebyshev Polynomials	claim
115	107	The Computational Complexity of Orientation Search Problems in Cryo-Electron Microscopy	claim
116	107	Encapsulation for Practical Simplification Procedures	claim
117	106	Intelligent Systems: Architectures and Perspectives	claim
118	106	Presynaptic modulation as fast synaptic switching: state-dependent modulation of task performance	claim
119	106	Roaming Real-Time Applications - Mobility Services in IPv6 Networks	claim
120	106	CrocoPat 2.1 Introduction and Reference Manual	claim
121	106	Why Delannoy numbers?	claim
122	105	A Grid-enabled Interface to Condor for Interactive Analysis on Handheld and Resource-limited Devices	claim
123	105	An Approximation Algorithm for Stackelberg Network Pricing	claim
124	105	Mathematical knowledge management is needed	claim
125	104	Inapproximability of Combinatorial Optimization Problems	claim
126	104	Multi-dimensional Type Theory: Rules, Categories, and Combinators for Syntax and Semantics	claim
127	104	Outflanking and securely using the PIN/TAN-System	claim
128	104	Near Rationality and Competitive Equilibria in Networked Systems	claim
129	104	Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves	claim
130	103	Quantum Computers	claim
131	103	The Freeze-Tag Problem: How to Wake Up a Swarm of Robots	claim
132	103	Towards a Model-Based Framework for Integrating Usability and Software Engineering Life Cycles	claim
133	103	Online convex optimization in the bandit setting: gradient descent without a gradient	claim
134	102	Unfolding Smooth Primsatoids	claim
135	102	The asymptotic number of binary codes and binary matroids	claim
136	102	Mass Storage Management and the Grid	claim
137	102	Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time	claim
138	102	Mutual Information and Minimum Mean-square Error in Gaussian Channels	claim
139	101	Parallel Computing Environments and Methods for Power Distribution System Simulation	claim
140	101	A Framework for Interoperability	claim
141	100	Test Collections for Patent-to-Patent Retrieval and Patent Map Generation in NTCIR-4 Workshop	claim
142	100	On the Theory of Structural Subtyping	claim
143	100	On Spatial Conjunction as Second-Order Logic	claim
144	100	An Example of Clifford Algebras Calculations with GiNaC	claim
145	100	Efficient Algorithms for Large-Scale Topology Discovery	claim
146	99	Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations	claim
147	99	Performance Analysis of the Globus Toolkit Monitoring and Discovery Service, MDS2	claim
148	99	Diagnosabilities of regular networks	claim
149	99	Merging costs for the additive Marcus-Lushnikov process, and Union-Find algorithms	claim
150	99	Threats of Human Error in a High-Performance Storage System: Problem Statement and Case Study	claim
151	99	A class of one-dimensional MDS convolutional codes	claim
152	99	Source-Channel Diversity for Parallel Channels	claim
153	98	A feasible algorithm for typing in Elementary Affine Logic	claim
154	97	Scalable Percolation Search in Power Law Networks	claim
155	97	Planning for Directory Services in Public Key Infrastructures	claim
156	97	The semijoin algebra and the guarded fragment	claim
157	97	Quantum typing	claim
158	97	Higher-Order Concurrent Win32 Programming	claim
159	97	Free quasi-symmetric functions, product actions and quantum field theory of partitions	claim
160	96	Convex Hull of Planar H-Polyhedra	claim
161	95	Unicyclic Components in Random Graphs	claim
162	95	A New Approach to Draw Detection by Move Repetition in Computer Chess Programming	claim
163	95	Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any Fixed Distance	claim
164	95	Distributed Computing Economics	claim
165	94	Note on Counting Eulerian Circuits	claim
166	94	Track Layouts of Graphs	claim
167	94	Side-Information Coding with Turbo Codes and its Application to Quantum Key Distribution	claim
168	94	Quantum Computing, Postselection, and Probabilistic Polynomial-Time	claim
169	93	A Search Relevancy Tuning Method Using Expert Results Content Evaluation	claim
170	93	Maximum Mutual Information of Space-Time Block Codes with Symbolwise Decodability	claim
171	93	What we should teach, but don't: Proposal for a cross pollinated HCI-SE curriculum	claim
172	93	Removing Propagation Redundant Constraints in Redundant Modeling	claim
173	92	Pseudorandom number generation by p-adic ergodic transformations: an addendum	claim
174	92	Paraconsistent Intuitionistic Fuzzy Relational Data Model	claim
175	92	Embeddings into the Pancake Interconnection Network	claim
176	92	Tournament versus Fitness Uniform Selection	claim
177	92	SDS : Une infrastructure d'installation de logiciels libres pour des organisations multi-sites	claim
178	92	A tutorial introduction to the minimum description length principle	claim
179	92	Tycoon: an Implementation of a Distributed, Market-based Resource Allocation System	claim
180	92	Web Usage Mining Using Artificial Ant Colony Clustering and Genetic Programming	claim
181	91	A Model for Fine-Grained Alignment of Multilingual Texts	claim
182	91	Better Quasi-Ordered Transition Systems	claim
183	91	Distributed Control by Lagrangian Steepest Descent	claim
184	91	Metrics for more than two points at once	claim
185	90	Topics in asynchronous systems	claim
186	90	A note on dimensions of polynomial size circuits	claim
187	90	Hypermedia Learning Objects System - On the Way to a Semantic Educational Web	claim
188	90	Shannon meets Wiener II: On MMSE estimation in successive decoding schemes	claim
189	90	Abstract Canonical Inference	claim
190	90	Non-computable Julia sets	claim
191	89	On the Inertia of the Asynchronous Circuits	claim
192	89	Cheap Recovery: A Key to Self-Managing State	claim
193	89	Topology of biological networks and reliability of information processing	claim
194	89	Improved Simulation of Stabilizer Circuits	claim
195	89	Gyroscopically Stabilized Robot: Balance and Tracking	claim
196	89	Partitioning Regular Polygons into Circular Pieces II:Nonconvex Partitions	claim
197	88	Sleeping Beauty Reconsidered: Conditioning and Reflection in Asynchronous Systems	claim
198	88	A Trace Logic for Local Security Properties	claim
199	88	A Note on the PAC Bayesian Theorem	claim
200	88	Programmable Ethernet Switches and Their Applications	claim
201	88	Unification of Fusion Theories	claim
202	88	A Fully Sparse Implementation of a Primal-Dual Interior-Point Potential Reduction Method for Semidefinite Programming	claim
203	87	Educational Content Management - A Cellular Approach	claim
204	87	Consensus on Transaction Commit	claim
205	87	Fibonacci connection between Huffman codes and Wythoff array	claim
206	87	Exploring tradeoffs in pleiotropy and redundancy using evolutionary computing	claim
207	87	Roles Are Really Great!	claim
208	87	ScotGrid: A Prototype Tier 2 Centre	claim
209	86	Evolutionary design of photometric systems and its application to Gaia	claim
210	86	Mapping Topics and Topic Bursts in PNAS	claim
211	86	Pandora : une plate-forme efficace pour la construction d'applications autonomes	claim
212	86	Probabilistic Solutions of Equations in the Braid Group	claim
213	86	Epistemic communities: description and hierarchic categorization	claim
214	85	Long Range Frustrations in a Spin Glass Model of the Vertex Cover Problem	claim
215	85	Predicate Abstraction with Indexed Predicates	claim
216	85	A dynamical model of a GRID market	claim
217	85	Using biased coins as oracles	claim
218	85	A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages	claim
219	85	Real Time Models of the Asynchronous Circuits: The Delay Theory	claim
220	84	Tabular Parsing	claim
221	84	Proofing Tools Technology at Neurosoft S.A	claim
222	84	The Generalized Pignistic Transformation	claim
223	83	Knowledge And The Action Description Language A	claim
224	83	A Comparison of Cryptography Courses	claim
225	83	Generating connected acyclic digraphs uniformly at random	claim
226	83	A proof of Alon's second eigenvalue conjecture and related problems	claim
227	83	INSPIRE: Evaluation of a Smart-Home System for Infotainment Management and Device Control	claim
228	82	Schema-based Scheduling of Event Processors and Buffer Minimization for Queries on Structured Data Streams	claim
229	82	There Goes the Neighborhood: Relational Algebra for Spatial Data Search	claim
230	82	Towards a Mathematical Theory of the Delays of the Asynchronous Circuits	claim
231	82	Protocol Requirements for Self-organizing Artifacts: Towards an Ambient Intelligence	claim
232	81	Encryption Schemes using Finite Frames and Hadamard Arrays	claim
233	81	Capacity-achieving ensembles for the binary erasure channel with bounded complexity	claim
234	81	A Sequent Calculus and a Theorem Prover for Standard Conditional Logics	claim
235	81	Optimizing genetic algorithm strategies for evolving networks	claim
236	81	Non-Termination Inference of Logic Programs	claim
237	81	Widening Operators for Weakly-Relational Numeric Abstractions (Extended Abstract)	claim
238	80	Notes On The Design Of An Internet Adversary	claim
239	79	Summarizing Encyclopedic Term Descriptions on the Web	claim
240	79	An Evaluated Certification Services System for the German National Root CA	claim
241	79	Thematic Annotation: extracting concepts out of documents	claim
242	78	Polarity sensitivity and evaluation order in type-logical grammar	claim
243	77	HEP@Home - A distributed computing system based on BOINC	claim
244	76	Quantum Complexity Classes	claim
245	76	A 2-chain can interlock with a k-chain	claim
246	76	Improved Upper Bound for the Redundancy of Fix-Free Codes	claim
247	76	Parallel Mixed Bayesian Optimization Algorithm: A Scaleup Analysis	claim
248	75	Modeling Chaotic Behavior of Stock Indices Using Intelligent Paradigms	claim
249	75	Outlier Detection by Logic Programming	claim
250	75	Locally connected spanning trees on graphs	claim
251	72	Some Applications of Coding Theory in Computational Complexity	claim
252	72	Visualising the structure of architectural open spaces based on shape analysis	claim
253	72	Lock-Free and Practical Deques using Single-Word Compare-And-Swap	claim
254	72	Jordan Normal and Rational Normal Form Algorithms	claim
255	71	Proportional Conflict Redistribution Rule	claim
256	71	A Public Reference Implementation of the RAP Anaphora Resolution Algorithm	claim
257	71	Towards a Flexible Intra-Trustcenter Management Protocol	claim
258	71	Gestion transactionnelle de la reprise sur erreurs dans le deploiement	claim
259	71	A novel approach to symbolic algebra	claim
260	70	Intelligent encoding and economical communication in the visual stream	claim
261	68	New Covert Channels in HTTP	claim
262	68	NoSEBrEaK - Attacking Honeynets	claim
263	62	Intrusion Detection Systems Using Adaptive Regression Splines	claim
264	59	Extending the SDSS Batch Query System to the National Virtual Observatory Grid	claim
265	58	Modelling the costs and benefits of Honeynets	claim
266	56	Examples of Models of the Asynchronous Circuits	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers