CORR 2010 - PDF Preprint Papers

CORR 2010 Workshop on Service Oriented Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CORR-2010 Paper

click to vote

CORR
2010
Springer

437views Education» more CORR 2010»

A Distributed Cluster Scheme For Bandwidth Management In Multi-hop MANETs

14 years 29 days ago

Download paper.ijcsns.org

Electronic collaboration among devices in a geographically localized environment is made possible with the implementation of IEEE 802.11 based wireless ad hoc networks. Dynamic na...

Binod Kumar Pattanayak, Alok Kumar Jagadev, Manoj ...

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	437	A Distributed Cluster Scheme For Bandwidth Management In Multi-hop MANETs	claim
2	432	A Distributed Trust Management Framework for Detecting Malicious Packet Dropping Nodes in a Mobile Ad Hoc Network	claim
3	427	A Comparison between Memetic algorithm and Genetic algorithm for the cryptanalysis of Simplified Data Encryption Standard algorithm	claim
4	388	Research Challenges for Enterprise Cloud Computing	claim
5	371	Experimentation for Packet Loss on MSP430 and nRF24L01 Based Wireless Sensor Network	claim
6	368	Quasigroups in cryptology	claim
7	352	Case Study On Social Engineering Techniques for Persuasion	claim
8	342	A Wireless Sensor Network Air Pollution Monitoring System	claim
9	342	Canonizable Partial Order Generators
10	338	Optimal Distributed P2P Streaming under Node Degree Bounds	claim
11	320	An algorithm for the principal component analysis of large data sets	claim
12	319	Investigating Output Accuracy for a Discrete Event Simulation Model and an Agent Based Simulation Model	claim
13	315	Light-Hierarchy: The Optimal Structure for Multicast Routing in WDM Mesh Networks	claim
14	312	Quantum One-Way Communication is Exponentially Stronger Than Classical Communication	claim
15	299	A New Energy Efficient Routing Algorithm Based on a New Cost Function in Wireless Ad hoc Networks	claim
16	286	PhishDef: URL Names Say It All	claim
17	282	A New Approach in Packet Scheduling in the Vanet	claim
18	279	Mining Frequent Itemsets Using Genetic Algorithm	claim
19	275	Dictionary Optimization for Block-Sparse Representations	claim
20	268	Bayesian Based Comment Spam Defending Tool	claim
21	261	Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel	claim
22	259	Community Detection in Networks: The Leader-Follower Algorithm	claim
23	258	Single Frame Image super Resolution using Learned Directionlets	claim
24	258	A Non-Cooperative Game Theoretical Approach For Power Control In Virtual MIMO Wireless Sensor Network	claim
25	257	Survey on Various Gesture Recognition Techniques for Interfacing Machines Based on Ambient Intelligence	claim
26	255	Scalable Tensor Factorizations for Incomplete Data	claim
27	255	Multiplierless Modules for Forward and Backward Integer Wavelet Transform	claim
28	254	Information-Theoretic Analysis of an Energy Harvesting Communication System	claim
29	253	Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition	claim
30	249	Lower Bounds on Near Neighbor Search via Metric Expansion	claim
31	249	Performance Analysis of Spectral Clustering on Compressed, Incomplete and Inaccurate Measurements	claim
32	248	Optimal Spectrum Sharing in MIMO Cognitive Radio Networks via Semidefinite Programming	claim
33	244	Fingerprint Recognition Using Minutia Score Matching	claim
34	241	Haar Wavelet Based Approach for Image Compression and Quality Assessment of Compressed Image	claim
35	238	Face Identification by SIFT-based Complete Graph Topology	claim
36	237	Featureless 2D-3D Pose Estimation by Minimising an Illumination-Invariant Loss	claim
37	236	Precise, Scalable and Online Request Tracing for Multi-tier Services of Black Boxes	claim
38	232	Application of Statistical Features in Handwritten Devnagari Character Recognition	claim
39	232	MiBoard: Multiplayer Interactive Board Game	claim
40	231	Delay-Based Back-Pressure Scheduling in Multi-Hop Wireless Networks	claim
41	230	Query-Efficient Locally Decodable Codes of Subexponential Length	claim
42	229	Market Equilibrium with Transaction Costs	claim
43	228	Sparse Inverse Covariance Selection via Alternating Linearization Methods	claim
44	225	Sensing Matrix Optimization for Block-Sparse Decoding	claim
45	225	Analysis of the Security of BB84 by Model Checking	claim
46	224	A Cluster Based Replication Architecture for Load Balancing in Peer-to-Peer Content Distribution	claim
47	221	Deterministic Sample Sort For GPUs	claim
48	221	Reduction of Feature Vectors Using Rough Set Theory for Human Face Recognition	claim
49	220	Multichannel Sampling of Pulse Streams at the Rate of Innovation	claim
50	219	Finding Sequential Patterns from Large Sequence Data	claim
51	219	Clustering high dimensional data using subspace and projected clustering algorithms	claim
52	219	Cooperative Algorithms for MIMO Interference Channels	claim
53	218	Anonimos: An LP based Approach for Anonymizing Weighted Social Network Graphs	claim
54	218	A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks	claim
55	218	User Centered and Ontology Based Information Retrieval System for Life Sciences	claim
56	217	Semi-Partitioned Hard Real-Time Scheduling with Restricted Migrations upon Identical Multiprocessor Platforms	claim
57	216	E2XLRADR (Energy Efficient Cross Layer Routing Algorithm with Dynamic Retransmission for Wireless Sensor Networks)	claim
58	215	Text Classification using the Concept of Association Rule of Data Mining	claim
59	215	Energy Efficient Clustering and Routing in Mobile Wireless Sensor Network	claim
60	215	Image Deblurring and Super-resolution by Adaptive Sparse Domain Selection and Adaptive Regularization	claim
61	215	Affine-invariant diffusion geometry for the analysis of deformable 3D shapes	claim
62	214	Hybrid Medical Image Classification Using Association Rule Mining with Decision Tree Algorithm	claim
63	214	Modeling Network Coded TCP Throughput: A Simple Model and its Validation	claim
64	213	Morphological study of Albanian words, and processing with NooJ	claim
65	212	Cryptanalysis of a more efficient and secure dynamic id-based remote user authentication scheme	claim
66	211	Studying the Feasibility and Importance of Software Testing: An Analysis	claim
67	210	Test Case Generation for Object-Oriented Imperative Languages in CLP	claim
68	210	Exploiting Statistical Dependencies in Sparse Representations for Signal Recovery	claim
69	210	Classification with Scattering Operators	claim
70	209	An Algorithm to Extract Rules from Artificial Neural Networks for Medical Diagnosis Problems	claim
71	209	Generalized Tree-Based Wavelet Transform	claim
72	208	MapReduce for Integer Factorization	claim
73	208	Bounded Model Checking of Multi-threaded Software using SMT solvers	claim
74	208	Discovering potential user browsing behaviors using custom-built apriori algorithm	claim
75	208	Real-time Robust Principal Components' Pursuit	claim
76	207	Collaborative Hierarchical Sparse Modeling	claim
77	207	A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks	claim
78	207	TILT: Transform Invariant Low-rank Textures	claim
79	206	Detecting Anomalous Process Behaviour using Second Generation Artificial Immune Systems	claim
80	205	Competition with Dynamic Spectrum Leasing	claim
81	205	Behavioral Simulations in MapReduce	claim
82	205	Identification of Underspread Linear Systems with Application to Super-Resolution Radar	claim
83	205	An Algorithm for Detection of Selfish Nodes in Wireless Mesh Networks	claim
84	204	Limited Feedback Multi-Antenna Quantization Codebook Design-Part II: Multiuser Channels	claim
85	204	Optimization Framework and Graph-Based Approach for Relay-Assisted Bidirectional OFDMA Cellular Networks	claim
86	204	Predictive State Temporal Difference Learning	claim
87	202	The Complexity of Reasoning for Fragments of Autoepistemic Logic	claim
88	202	Using vector divisions in solving linear complementarity problem	claim
89	201	Online Advertisement, Optimization and Stochastic Networks	claim
90	200	Unified Compression-Based Acceleration of Edit-Distance Computation	claim
91	200	A Multilevel Approach For Nonnegative Matrix Factorization	claim
92	199	Comparative Investigation for Energy Consumption of Different Chipsets Based on Scheduling for Wireless Sensor Networks	claim
93	198	Downlink Interference Alignment	claim
94	198	Space and the Synchronic A-Ram	claim
95	198	Customized way of Resource Discovery in a Campus Grid	claim
96	198	Convex Graph Invariants	claim
97	197	Modelling of Human Glottis in VLSI for Low Power Architectures	claim
98	197	Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents	claim
99	197	Quantum Strategic Game Theory	claim
100	197	Interference Alignment Through User Cooperation for Two-cell MIMO Interfering Broadcast Channels	claim
101	196	SWiM -- A Semantic Wiki for Mathematical Knowledge Management	claim
102	196	Comparison Of Modified Dual Ternary Indexing And Multi-Key Hashing Algorithms For Music Information Retrieval	claim
103	196	Low Power Reversible Parallel Binary Adder/Subtractor	claim
104	195	Dynamic management of transactions in distributed real-time processing system	claim
105	195	Energy Optimal Transmission Scheduling in Wireless Sensor Networks	claim
106	194	A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems	claim
107	194	An Effective Method of Image Retrieval using Image Mining Techniques	claim
108	193	A Probabilistic Approach for Learning Folksonomies from Structured Data	claim
109	192	Temporal Link Prediction using Matrix and Tensor Factorizations	claim
110	192	Constructing elliptic curve isogenies in quantum subexponential time	claim
111	191	Dual Watermarking Scheme with Encryption	claim
112	190	Bidimensionality and EPTAS	claim
113	190	A generic tool to generate a lexicon for NLP from Lexicon-Grammar tables	claim
114	190	Overlap properties of geometric expanders	claim
115	190	Stable marriage problems with quantitative preferences	claim
116	190	Beyond Space For Spatial Networks	claim
117	189	ACRR: Ad Hoc On-Demand Distance Vector Routing with Controlled Route Requests	claim
118	189	The Application of Cloud Computing to the Creation of Image Mosaics and Management of Their Provenance	claim
119	189	Coalition Formation Games for Collaborative Spectrum Sensing	claim
120	189	Approaching Throughput-optimality in Distributed CSMA Scheduling Algorithms with Collisions	claim
121	189	An Optimal Dynamic Mechanism for Multi-Armed Bandit Processes	claim
122	189	Robust PCA via Outlier Pursuit	claim
123	188	Agent Based Trust Management Model Based on Weight Value Model for Online Auctions	claim
124	188	A physically-based particle model of emergent crowd behaviors	claim
125	188	A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers	claim
126	188	A Novel Algorithm for Cooperative Distributed Sequential Spectrum Sensing in Cognitive Radio	claim
127	187	Learning in A Changing World: Non-Bayesian Restless Multi-Armed Bandit	claim
128	186	Significant Interval and Frequent Pattern Discovery in Web Log Data	claim
129	186	Color Image Compression Based On Wavelet Packet Best Tree	claim
130	186	Cooperative Sequential Spectrum Sensing Algorithms for OFDM	claim
131	186	Channel Estimation for Opportunistic Spectrum Access: Uniform and Random Sensing	claim
132	186	Capacitated Caching Games	claim
133	186	A Homogeneous Reaction Rule Language for Complex Event Processing	claim
134	186	Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks	claim
135	186	A PDTB-Styled End-to-End Discourse Parser	claim
136	186	QoS Routing in Smart Grid	claim
137	185	Estimating and Sampling Graphs with Multidimensional Random Walks	claim
138	185	Pseudorandom generators and the BQP vs. PH problem	claim
139	185	A new exponential separation between quantum and classical one-way communication complexity	claim
140	185	Acdmcp: An adaptive and completely distributed multi-hop clustering protocol for wireless sensor networks	claim
141	185	Analysing the behaviour of robot teams through relational sequential pattern mining	claim
142	184	Image Pixel Fusion for Human Face Recognition	claim
143	184	Comparison of different Broadcast Schemes for Multi-Hop Wireless Sensor Networks	claim
144	184	Extended Two-Dimensional PCA for Efficient Face Representation and Recognition	claim
145	184	Strong Secrecy and Reliable Byzantine Detection in the Presence of an Untrusted Relay	claim
146	183	Forming the COUNCIL Based Clusters in Securing Wireless Ad Hoc Networks	claim
147	183	A Game Theoretical Approach to Modeling Information Dissemination in Social Networks	claim
148	183	On the Energy Efficiency of LT Codes in Proactive Wireless Sensor Networks	claim
149	183	Discovering shared and individual latent structure in multiple time series	claim
150	182	Semantic Modeling and Retrieval of Dance Video Annotations	claim
151	182	Index coding via linear programming	claim
152	182	Fast Convergence of Natural Bargaining Dynamics in Exchange Networks	claim
153	182	Component structure induced by a random walk on a random graph	claim
154	182	SPOT: An R Package For Automatic and Interactive Tuning of Optimization Algorithms by Sequential Parameter Optimization	claim
155	182	The Hitchhiker's Guide to Affiliation Networks: A Game-Theoretic Approach	claim
156	181	Data Hiding Techniques Using Prime and Natural Numbers	claim
157	181	Sparse Recovery with Orthogonal Matching Pursuit under RIP	claim
158	181	Mapping XML Data to Relational Data: A DOM-Based Approach	claim
159	180	A Meta-Programming Approach to Realizing Dependently Typed Logic Programming	claim
160	180	A Network Coding Approach to Loss Tomography
161	180	Sawja: Static Analysis Workshop for Java	claim
162	180	Dependability in Aggregation by Averaging	claim
163	180	Shortest path problem in rectangular complexes of global nonpositive curvature	claim
164	180	XSB: Extending Prolog with Tabled Logic Programming	claim
165	180	A Hybrid RTS-BP Algorithm for Improved Detection of Large-MIMO M-QAM Signals	claim
166	179	Highway Mobility and Vehicular Ad-Hoc Networks in NS-3	claim
167	179	Active Testing for Face Detection and Localization	claim
168	179	An Economic-based Resource Management and Scheduling for Grid Computing Applications	claim
169	179	The DMM bound: multivariate (aggregate) separation bounds	claim
170	179	Algebraic Constructions of Graph-Based Nested Codes from Protographs	claim
171	179	Comparison of Support Vector Machine and Back Propagation Neural Network in Evaluating the Enterprise Financial Distress	claim
172	179	Collaborative Knowledge Creation and Management in Information Retrieval	claim
173	178	Hyperbolic Geometry of Complex Networks	claim
174	178	Automatic Recommendation for Online Users Using Web Usage Mining	claim
175	178	Fast Histograms using Adaptive CUDA Streams	claim
176	178	Formalization of the data flow diagram rules for consistency check	claim
177	178	Towards A Shape Analysis for Graph Transformation Systems	claim
178	178	Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings	claim
179	178	Adaptive Algorithms for Coverage Control and Space Partitioning in Mobile Robotic Networks	claim
180	178	Is Light-Tree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Networks?	claim
181	177	Understanding Formulation of Social Capital in Online Social Network Sites (SNS)	claim
182	177	Supervised Random Walks: Predicting and Recommending Links in Social Networks	claim
183	177	Dynamic Scheduling of Skippable Periodic Tasks with Energy Efficiency in Weakly Hard Real-Time System	claim
184	177	AntiJam: Efficient Medium Access despite Adaptive and Reactive Jamming	claim
185	177	A simple and practical algorithm for differentially private data release	claim
186	176	Limited Feedback Multi-Antenna Quantization Codebook Design-Part I: Single-User Channels	claim
187	176	A General Framework for Graph Sparsification	claim
188	176	Network Traffic Anomalies Detection and Identification with Flow Monitoring	claim
189	176	Sequential item pricing for unlimited supply	claim
190	176	Bus Protocols: MSC-Based Specifications and Translation into Program of Verification Tool for Formal Verification	claim
191	176	Abstraction for Epistemic Model Checking of Dining Cryptographers-based Protocols	claim
192	176	Emergency Response Communications and Associated Security Challenges	claim
193	176	On the Capacity of the 2-user Gaussian MAC Interfering with a P2P Link	claim
194	176	Competitive Spectrum Management with Incomplete Information	claim
195	176	Cooperative Distributed Sequential Spectrum Sensing	claim
196	175	Incorporating Side Information in Probabilistic Matrix Factorization with Gaussian Processes	claim
197	175	Detecting Security threats in the Router using Computational Intelligence	claim
198	175	The Dynamics of Vehicular Networks in Urban Environments	claim
199	175	Optimal Packet Scheduling in an Energy Harvesting Communication System	claim
200	175	On affine rigidity	claim
201	175	Efficient Packet Forwarding Approach in Vehicular Ad Hoc Networks Using EBGR Algorithm	claim
202	175	Improving the Performance of maxRPC	claim
203	175	On the Combinatorial Multi-Armed Bandit Problem with Markovian Rewards	claim
204	174	Hybrid Numerical Solution of the Chemical Master Equation	claim
205	174	Fractional generalizations of Young and Brunn-Minkowski inequalities	claim
206	174	Collaborative Spectrum Sensing from Sparse Observations in Cognitive Radio Networks	claim
207	174	Gaussian Process Bandits for Tree Search	claim
208	174	Multiuser broadcast erasure channel with feedback - capacity and algorithms	claim
209	174	Cut Elimination for a Logic with Induction and Co-induction	claim
210	174	A Proof Carrying Code Framework for Inlined Reference Monitors in Java Bytecode	claim
211	173	CONCISE: Compressed 'n' Composable Integer Set	claim
212	173	Towards Conceptual Multidimensional Design in Decision Support Systems	claim
213	173	Automatic Modular Abstractions for Template Numerical Constraints	claim
214	173	Local search for stable marriage problems	claim
215	173	The Naming Game in Social Networks: Community Formation and Consensus Engineering	claim
216	173	An Approach to Ad hoc Cloud Computing	claim
217	173	A framework for proving the self-organization of dynamic systems	claim
218	173	DBSR: Dynamic base station Repositioning using Genetic algorithm in wireless sensor network	claim
219	173	Mining Multi-Level Frequent Itemsets under Constraints	claim
220	172	Seeing Through Black Boxes : Tracking Transactions through Queues under Monitoring Resource Constraints	claim
221	172	The MUSIC Algorithm for Sparse Objects: A Compressed Sensing Analysis	claim
222	172	Alternating-Offer Bargaining Games over the Gaussian Interference Channel	claim
223	172	Integrating User's Domain Knowledge with Association Rule Mining	claim
224	171	Reliable Mining of Automatically Generated Test Cases from Software Requirements Specification (SRS)	claim
225	171	Randomized Lattice Decoding	claim
226	171	An Object-Oriented Metamodel for Bunge-Wand-Weber Ontology	claim
227	171	Recursive Information Hiding in Visual Cryptography	claim
228	171	Solving Inverse Problems with Piecewise Linear Estimators: From Gaussian Mixture Models to Structured Sparsity	claim
229	171	Graphical Models Concepts in Compressed Sensing	claim
230	171	Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach	claim
231	170	Sidelobe Control in Collaborative Beamforming via Node Selection	claim
232	170	Global Optimization for Value Function Approximation	claim
233	170	Slow Adaptive OFDMA Systems Through Chance Constrained Programming	claim
234	170	Rule-based Generation of Diff Evolution Mappings between Ontology Versions	claim
235	169	The Privacy Coach: Supporting customer privacy in the Internet of Things	claim
236	169	ElasTraS: An Elastic Transactional Data Store in the Cloud	claim
237	169	Spiking Neurons with ASNN Based-Methods for the Neural Block Cipher	claim
238	169	Near-Oracle Performance of Greedy Block-Sparse Estimation Techniques from Noisy Measurements	claim
239	169	Artificial Hormone Reaction Networks: Towards Higher Evolvability in Evolutionary Multi-Modular Robotics	claim
240	169	Multimodal Biometric Systems - Study to Improve Accuracy and Performance	claim
241	169	Recommender Systems by means of Information Retrieval	claim
242	168	Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs	claim
243	168	Fault Tolerant Wireless Sensor MAC Protocol for Efficient Collision Avoidance	claim
244	168	Competition of Wireless Providers for Atomic Users	claim
245	168	A Bayesian Review of the Poisson-Dirichlet Process	claim
246	168	Penalty Decomposition Methods for Rank Minimization	claim
247	168	Network evolution and QOS provisioning for integrated femtocell/macrocell networks	claim
248	168	Mobile Based Secure Digital Wallet for Peer to Peer Payment System	claim
249	168	Gaussian Process Structural Equation Models with Latent Variables	claim
250	168	Adding HL7 version 3 data types to PostgreSQL	claim
251	168	Bounds on the maximum multiplicity of some common geometric graphs	claim
252	168	In Cloud, Can Scientific Communities Benefit from the Economies of Scale?	claim
253	167	The DCA:SOMe Comparison A comparative study between two biologically-inspired algorithms	claim
254	167	I-Min: An Intelligent Fermat Point Based Energy Efficient Geographic Packet Forwarding Technique for Wireless Sensor and Ad Hoc Networks	claim
255	167	Development of a Context Aware Virtual Smart Home Simulator	claim
256	167	Security Mitigations for Return-Oriented Programming Attacks	claim
257	167	Network Flow Algorithms for Structured Sparsity	claim
258	167	Performance Analysis of an Improved Graded Precision Localization Algorithm for Wireless Sensor Networks	claim
259	167	Collaborative Astronomical Image Mosaics	claim
260	167	Compressive Sensing over Graphs	claim
261	166	The dynamics of message passing on dense graphs, with applications to compressed sensing	claim
262	166	Software Metrics Evaluation Based on Entropy	claim
263	166	On Exponential Sums, Nowton identities and Dickson Polynomials over Finite Fields	claim
264	166	A CHAID Based Performance Prediction Model in Educational Data Mining	claim
265	166	Bandwidth Modeling and Estimation in Peer to Peer Networks	claim
266	166	I-Interaction: An Intelligent In-Vehicle User Interaction Model	claim
267	166	A new closed-loop output error method for parameter identification of robot dynamics	claim
268	166	Computer Aided Design Modeling for Heterogeneous Objects	claim
269	165	Compressed Sensing for Sparse Underwater Channel Estimation: Some Practical Considerations	claim
270	165	Physically-based particle simulation and visualization of pastes and gels	claim
271	165	Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic	claim
272	165	Coalition Formation Games for Distributed Cooperation Among Roadside Units in Vehicular Networks	claim
273	165	Detecting Ontological Conflicts in Protocols between Semantic Web Services	claim
274	165	Performance Analysis of a 60 GHz Near Gigabit System for WPAN Applications	claim
275	165	Online Learning: Beyond Regret	claim
276	165	Monte Carlo Methods for Top-k Personalized PageRank Lists and Name Disambiguation	claim
277	164	Gaze and Gestures in Telepresence: multimodality, embodiment, and roles of collaboration	claim
278	164	Schnyder decompositions for regular plane graphs and application to drawing	claim
279	164	Sub-Nyquist Sampling of Short Pulses: Part I	claim
280	164	Random Projection Trees Revisited
281	164	Ciphertext Policy Attribute based Encryption with anonymous access policy	claim
282	164	Performance Comparison of Link, Node and Zone Disjoint Multi-path Routing Strategies and Minimum Hop Single Path Routing for Mobile Ad Hoc Networks	claim
283	164	Is submodularity testable?	claim
284	164	Approximate Nash Equilibria under Stability Conditions	claim
285	164	Securing AODV for MANETs using Message Digest with Secret Key	claim
286	164	Precedence Automata and Languages	claim
287	163	Distributed Principal Component Analysis for Wireless Sensor Networks	claim
288	163	A Novel Approach Towards Cost Effective Region-Based Group Key Agreement Protocol for Peer - to - Peer Information Sharing in Mobile Ad Hoc Networks	claim
289	163	Faster Rates for training Max-Margin Markov Networks	claim
290	163	Faster Algorithms for Semi-Matching Problems	claim
291	163	Design of QoS-aware Provisioning Systems	claim
292	163	NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems	claim
293	163	Toward a Push-Scalable Global Internet	claim
294	162	A distributed file system for a wide-area high performance computing infrastructure	claim
295	162	Random sampling of lattice paths with constraints, via transportation	claim
296	162	Multi-standard programmable baseband modulator for next generation wireless communication	claim
297	162	Power Allocation Games in Wireless Networks of Multi-antenna Terminals	claim
298	162	Networked Computing in Wireless Sensor Networks for Structural Health Monitoring	claim
299	162	Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis	claim
300	162	Differential Privacy versus Quantitative Information Flow	claim
301	162	Cross-Composition: A New Technique for Kernelization Lower Bounds	claim
302	162	First steps in the logic-based assessment of post-composed phenotypic descriptions	claim
303	161	Database Reverse Engineering based on Association Rule Mining	claim
304	161	CrystalGPU: Transparent and Efficient Utilization of GPU Power	claim
305	160	An LSB Data Hiding Technique Using Natural Numbers	claim
306	160	PCA 4 DCA: The Application Of Principal Component Analysis To The Dendritic Cell Algorithm	claim
307	160	Scalable Probabilistic Databases with Factor Graphs and MCMC	claim
308	160	New Results on Quantum Property Testing	claim
309	160	A Semi-distributed Reputation Based Intrusion Detection System for Mobile Adhoc Networks	claim
310	160	Developing courses with HoloRena, a framework for scenario- and game based e-learning environments	claim
311	160	Fusion of Wavelet Coefficients from Visual and Thermal Face Images for Human Face Recognition - A Comparative Study	claim
312	160	Routing with Mutual Information Accumulation in Wireless Networks	claim
313	159	An Alternative Proof for the Capacity Region of the Degraded Gaussian MIMO Broadcast Channel	claim
314	159	Lightweight Mutual Authentication Protocol for Low Cost RFID Tags	claim
315	159	Outlier Detection Using Nonconvex Penalized Regression	claim
316	159	Survey of trust models in different network domains	claim
317	159	An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks	claim
318	159	A Novel VLSI Architecture of Fixed-complexity Sphere Decoder	claim
319	159	On optimizing over lift-and-project closures	claim
320	159	Counting Plane Graphs: Flippability and its Applications	claim
321	158	A Minimal Propositional Type Theory	claim
322	158	Epistemic Model Checking for Knowledge-Based Program Implementation: an Application to Anonymous Broadcast	claim
323	158	Architecture for Cooperative Prefetching in P2P Video-on- Demand System	claim
324	158	A Survey on Temporal Logics	claim
325	158	Active Architecture for Pervasive Contextual Services	claim
326	158	Unifying the Landscape of Cell-Probe Lower Bounds	claim
327	158	Dynamic Multi Layer Signature based Intrusion Detection system Using Mobile Agents	claim
328	158	Clustered Hierarchy in Sensor Networks: Performance and Security	claim
329	158	Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function	claim
330	158	Efficient Approaches for Designing Fault Tolerant Reversible Carry Look-Ahead and Carry-Skip Adders	claim
331	157	A Survey on Network Codes for Distributed Storage	claim
332	157	Detecting Coordination Problems in Collaborative Software Development Environments	claim
333	157	Joint Bandwidth and Power Allocation with Admission Control in Wireless Multi-User Networks With and Without Relaying	claim
334	157	Certification Authority Monitored Multilevel and Stateful Policy Based Authorization in Services Oriented Grids	claim
335	157	A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing	claim
336	157	Context Awareness Framework Based on Contextual Graph	claim
337	157	Context Ontology Implementation for Smart Home	claim
338	157	Deriving Specifications of Dependable Systems: toward a Method	claim
339	157	Efficient Clustering with Limited Distance Information	claim
340	157	Clandestine Simulations in Cellular Automata	claim
341	157	Introduction to the non-asymptotic analysis of random matrices	claim
342	157	Active Integrity Constraints and Revision Programming	claim
343	157	Stochastic Budget Optimization in Internet Advertising	claim
344	157	On the Minimal Uncompletable Word Problem	claim
345	157	Constraint-Guided Workflow Composition Based on the EDAM Ontology	claim
346	157	Using Semantic Wikis for Structured Argument in Medical Domain	claim
347	156	MIMO Transmission with Residual Transmit-RF Impairments	claim
348	156	On the bias of BFS	claim
349	156	On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage	claim
350	156	The Exact Closest String Problem as a Constraint Satisfaction Problem	claim
351	156	Modelling Reactive and Proactive Behaviour in Simulation	claim
352	156	Topological analysis of the power grid and mitigation strategies against cascading failures	claim
353	156	Building Reusable Software Component For Optimization Check in ABAP Coding	claim
354	156	On CSP and the Algebraic Theory of Effects	claim
355	156	A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set	claim
356	156	Selling Privacy at Auction	claim
357	156	Scheduling Periodic Real-Time Tasks with Heterogeneous Reward Requirements	claim
358	156	Imitation learning of motor primitives and language bootstrapping in robots	claim
359	156	FauxCrypt - A Method of Text Obfuscation	claim
360	155	Data-driven Co-clustering Model of Internet Usage in Large Mobile Societies	claim
361	155	Repairing People Trajectories Based on Point Clustering	claim
362	155	Towards Performance Measurement And Metrics Based Analysis of PLA Applications	claim
363	155	Combinatorial Approximation Algorithms for MaxCut using Random Walks	claim
364	155	Drawing Trees with Perfect Angular Resolution and Polynomial Area	claim
365	155	A New Upper Bound on the Average Error Exponent for Multiple-Access Channels	claim
366	155	A QoS Provisioning Recurrent Neural Network based Call Admission Control for beyond 3G Networks	claim
367	155	A Proof Theoretic Analysis of Intruder Theories	claim
368	155	Exploiting Temporal Complex Network Metrics in Mobile Malware Containment	claim
369	155	A Complexity View of Markets with Social Influence	claim
370	154	A Framework for Agile Development of Component-Based Applications	claim
371	154	Causal Markov condition for submodular information measures	claim
372	154	Cross Layer Aware Adaptive MAC based on Knowledge Based Reasoning for Cognitive Radio Computer Networks	claim
373	154	Improved Approximation Guarantees for Sublinear-Time Fourier Algorithms	claim
374	154	Algorithmic Thermodynamics	claim
375	154	A New Email Retrieval Ranking Approach	claim
376	154	Shaping Level Sets with Submodular Functions	claim
377	154	Complexity of Homogeneous Co-Boolean Constraint Satisfaction Problems	claim
378	153	Multidimensional Data Structures and Techniques for Efficient Decision Making	claim
379	153	Adaptation of TURN protocol to SIP protocol	claim
380	153	Towards Parameterized Regular Type Inference Using Set Constraints	claim
381	153	Towards an Efficient Tile Matrix Inversion of Symmetric Positive Definite Matrices on Multicore Architectures	claim
382	153	The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version	claim
383	153	GraphLab: A New Framework for Parallel Machine Learning	claim
384	153	Characterising Probabilistic Processes Logically	claim
385	153	Influence and Passivity in Social Media	claim
386	153	Secured Greedy Perimeter Stateless Routing for Wireless Sensor Networks	claim
387	153	The Complexity of Causality and Responsibility for Query Answers and non-Answers	claim
388	153	To Feed or Not to Feed Back	claim
389	153	Integration of Agile Ontology Mapping towards NLP Search in I-SOAS	claim
390	153	Approximate Judgement Aggregation	claim
391	152	Automatic analysis of distance bounding protocols	claim
392	152	Predicting the Future with Social Media	claim
393	152	Neuroevolutionary optimization	claim
394	152	Microlocal Analysis of the Geometric Separation Problem	claim
395	152	Deploying Wireless Networks with Beeps	claim
396	152	A Faster Algorithm for Quasi-convex Integer Polynomial Optimization	claim
397	152	A Non-Null Annotation Inferencer for Java Bytecode	claim
398	152	A Block Based Scheme for Enhancing Low Luminated Images	claim
399	152	Applications of Geometric Algorithms to Reduce Interference in Wireless Mesh Network	claim
400	152	A new key establishment scheme for wireless sensor networks	claim
401	152	Power Allocation and Spectrum Sharing in Multi-User, Multi-Channel Systems with Strategic Users	claim
402	152	Evolutionary Approach to Test Generation for Functional BIST	claim
403	152	Fault Tolerant Variable Block Carry Skip Logic (VBCSL) using Parity Preserving Reversible Gates	claim
404	152	Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards	claim
405	151	Indicators of the Interdisciplinarity of Journals: Diversity, Centrality, and Citations	claim
406	151	How to prevent type-flaw attacks on security protocols under algebraic properties	claim
407	151	Behavioural Correlation for Detecting P2P Bots	claim
408	151	Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search	claim
409	151	The Challenge of Believability in Video Games: Definitions, Agents Models and Imitation Learning	claim
410	151	Fuzzy Ontology Representation using OWL 2	claim
411	151	On the Convexity of Latent Social Network Inference	claim
412	151	Dynamic Range Reporting in External Memory	claim
413	151	Adding a referee to an interconnection network: What can(not) be computed in one round	claim
414	151	A Comprehensive Survey of Data Mining-based Fraud Detection Research	claim
415	151	Travel Time Estimation Using Floating Car Data	claim
416	151	Selective Call Out and Real Time Bidding	claim
417	150	Dendritic Cells for Real-Time Anomaly Detection	claim
418	150	Existence and Global Logarithmic Stability of Impulsive Neural Networks with Time Delay	claim
419	150	Framework for Visualizing Model-Driven Software Evolution and its Application	claim
420	150	On Generation of Firewall Log Status Reporter (SRr) Using Perl	claim
421	150	Boosting Multi-Core Reachability Performance with Shared Hash Tables	claim
422	150	A Middleware Framework for Constraint-Based Deployment and Autonomic Management of Distributed Applications	claim
423	150	Stable partitions in additively separable hedonic games	claim
424	150	Don't 'have a clue'? Unsupervised co-learning of downward-entailing operators	claim
425	150	Extraction of Symbolic Rules from Artificial Neural Networks	claim
426	150	On extracting common random bits from correlated sources	claim
427	149	Lower Bounds for the Complexity of Monadic Second-Order Logic	claim
428	149	Pebbling and Branching Programs Solving the Tree Evaluation Problem	claim
429	149	Using Rough Set and Support Vector Machine for Network Intrusion Detection	claim
430	149	Group Testing with Probabilistic Tests: Theory, Design and Application	claim
431	149	A probabilistic and RIPless theory of compressed sensing	claim
432	149	Hallway Monitoring: Distributed Data Processing with Wireless Sensor Networks	claim
433	149	Constructions of Optical Queues With a Limited Number of Recirculations--Part II: Optimal Constructions	claim
434	148	Low Rate Sampling of Pulse Streams with Application to Ultrasound Imaging	claim
435	148	Perturbation Resilience and Superiorization of Iterative Algorithms	claim
436	148	Techniques for Enhanced Physical-Layer Security	claim
437	148	Approximability of the Multiple Stack TSP	claim
438	148	Data Sharing Options for Scientific Workflows on Amazon EC2	claim
439	148	List decoding for nested lattices and applications to relay channels	claim
440	148	A Unifying View of Multiple Kernel Learning	claim
441	147	Multistage Relaying Using Interference Networks	claim
442	147	High-Rate Quantization for the Neyman-Pearson Detection of Hidden Markov Processes	claim
443	147	Chunky and Equal-Spaced Polynomial Multiplication	claim
444	147	Learning Probabilistic Hierarchical Task Networks to Capture User Preferences	claim
445	147	A convenient differential category	claim
446	147	Single Parameter Combinatorial Auctions with Partially Public Valuations	claim
447	147	Distributed Storage Codes Meet Multiple-Access Wiretap Channels	claim
448	147	Mechanized semantics	claim
449	147	Modeling the structure and evolution of discussion cascades	claim
450	147	Safety Message Power Transmission Control for Vehicular Ad hoc Networks	claim
451	147	Cluster based Key Management in Wireless Sensor Networks	claim
452	147	Fractionally Predictive Spiking Neurons	claim
453	147	Strong direct product theorems for quantum communication and query complexity	claim
454	147	Matching Dependencies with Arbitrary Attribute Values: Semantics, Query Answering and Integrity Constraints	claim
455	147	RAFDA: A Policy-Aware Middleware Supporting the Flexible Separation of Application Logic from Distribution	claim
456	146	Multicast Outage Probability and Transmission Capacity of Multihop Wireless Networks	claim
457	146	Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization	claim
458	146	Liberalizing Dependency	claim
459	146	Formal Relationships Between Geometrical and Classical Models for Concurrency	claim
460	146	GRASP for the Coalition Structure Formation Problem	claim
461	146	Active Learning for Hidden Attributes in Networks	claim
462	146	Optimal power allocation for downstream xDSL with per-modem total power constraints : Broadcast Channel Optimal Spectrum Balancing (BC-OSB)	claim
463	146	Building Computer Network Attacks	claim
464	146	Abstract Fixpoint Computations with Numerical Acceleration Methods	claim
465	146	An Empirical Study on Content Bundling in BitTorrent Swarming System	claim
466	146	Modified Bully Algorithm using Election Commission	claim
467	146	Multi-Criteria Evaluation of Partitioning Schemes for Real-Time Systems	claim
468	146	NLHB : A Non-Linear Hopper Blum Protocol	claim
469	145	Random Indexing K-tree	claim
470	145	Distributed Rate Allocation Policies for Multi-Homed Video Streaming over Heterogeneous Access Networks	claim
471	145	Detection and Demarcation of Tumor using Vector Quantization in MRI images	claim
472	145	Feature Level Clustering of Large Biometric Database	claim
473	145	Network error correction with unequal link capacities	claim
474	145	CAT-generation of ideals	claim
475	145	Outer Bounds for the Interference Channel with a Cognitive Relay	claim
476	145	Dynamic Capitalization and Visualization Strategy in Collaborative Knowledge Management System for EI Process	claim
477	145	Orthogonal symmetric Toeplitz matrices for compressed sensing: Statistical isometry property	claim
478	144	Assessing Cognitive Load on Web Search Tasks	claim
479	144	Asymptotically Stable Walking of a Five-Link Underactuated 3D Bipedal Robot	claim
480	144	Privacy-Preserving Protocols for Eigenvector Computation	claim
481	144	Stochastic Games for Security in Networks with Interdependent Nodes	claim
482	144	The Magnetic Tower of Hanoi	claim
483	144	Mosaic: Policy Homomorphic Network Extension	claim
484	144	Optimal Partitions in Additively Separable Hedonic Games	claim
485	144	Adaptive Demodulation in Differentially Coherent Phase Systems: Design and Performance Analysis	claim
486	144	Secure Transmission with Multiple Antennas II: The MIMOME Wiretap Channel	claim
487	144	Algorithmic Verification of Single-Pass List Processing Programs	claim
488	144	Catching the Ouroboros: On Debugging Non-ground Answer-Set Programs	claim
489	144	A secure email login system using virtual password	claim
490	144	Hitting forbidden minors: Approximation and Kernelization	claim
491	144	Efficient Minimization of Decomposable Submodular Functions	claim
492	144	A Parallel Framework for Multilayer Perceptron for Human Face Recognition	claim
493	144	CLP-based protein fragment assembly	claim
494	144	Choosability in geometric hypergraphs	claim
495	144	On the Fictitious Play and Channel Selection Games	claim
496	144	Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata	claim
497	144	Recognition of Non-Compound Handwritten Devnagari Characters using a Combination of MLP and Minimum Edit Distance	claim
498	144	Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs	claim
499	144	Kolmogorov Complexity in perspective. Part I: Information Theory and Randomnes	claim
500	144	An In-depth Analysis of Spam and Spammers	claim
501	144	DNA Sequencing via Quantum Mechanics and Machine Learning	claim
502	143	Dendritic Cells for Anomaly Detection	claim
503	143	A Comparative Study of Removal Noise from Remote Sensing Image	claim
504	143	Parikh Images of Regular Languages: Complexity and Applications	claim
505	143	The Complexity of Proving the Discrete Jordan Curve Theorem	claim
506	143	Efficient and exact sampling of simple graphs with given arbitrary degree sequence	claim
507	143	Mathematical Foundations for a Compositional Distributional Model of Meaning	claim
508	143	Expressiveness of Generic Process Shape Types	claim
509	143	Opportunistic Routing in Ad Hoc Networks: How many relays should there be? What rate should nodes use?	claim
510	143	Flows and Decompositions of Games: Harmonic and Potential Games	claim
511	143	Compressed Sensing with Coherent and Redundant Dictionaries	claim
512	143	An Algorithm to List All the Fixed-Point Free Involutions on a Finite Set	claim
513	143	Continuum Percolation in the Intrinsically Secure Communications Graph	claim
514	143	Perceptual Copyright Protection Using Multiresolution Wavelet-Based Watermarking And Fuzzy Logic	claim
515	143	Security Enhancement With Optimal QOS Using EAP-AKA In Hybrid Coupled 3G-WLAN Convergence Network	claim
516	143	Algorithmic Detection of Computer Generated Text	claim
517	143	Quasi-randomness of graph balanced cut properties	claim
518	143	Connectivity in Sub-Poisson Networks	claim
519	143	High-SIR Transmission Capacity of Wireless Networks with General Fading and Node Distribution	claim
520	143	Parallel Sorted Neighborhood Blocking with MapReduce	claim
521	143	CUR from a Sparse Optimization Viewpoint	claim
522	143	Cause Clue Clauses: Error Localization using Maximum Satisfiability	claim
523	143	Convergence and Next Generation Networks	claim
524	143	The Non-Bayesian Restless Multi-Armed Bandit: a Case of Near-Logarithmic Regret	claim
525	143	Dynamics of Profit-Sharing Games	claim
526	142	Algebraic Network Coding Approach to Deterministic Wireless Relay Networks	claim
527	142	Graph Zeta Function in the Bethe Free Energy and Loopy Belief Propagation	claim
528	142	XPath Whole Query Optimization	claim
529	142	The Accuracy of Tree-based Counting in Dynamic Networks	claim
530	142	Capacity-Equivocation Region of the Gaussian MIMO Wiretap Channel	claim
531	142	Two-dimensional ranking of Wikipedia articles	claim
532	142	Integrality Gaps of Linear and Semi-definite Programming Relaxations for Knapsack	claim
533	142	A Fault Analytic Method against HB+	claim
534	142	Gossip Algorithms for Distributed Signal Processing	claim
535	142	HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget	claim
536	142	Budget Feasible Mechanisms	claim
537	142	Constructions of Optical Queues With a Limited Number of Recirculations--Part I: Greedy Constructions	claim
538	142	M-Learning: A New Paradigm of Learning Mathematics in Malaysia	claim
539	142	On the Benefit of Virtualization: Strategies for Flexible Server Allocation	claim
540	142	Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription	claim
541	141	Termination Detection of Local Computations	claim
542	141	FPGA Implementation of LS Code Generator for CDM Based MIMO Channel Sounder	claim
543	141	FIFO anomaly is unbounded	claim
544	141	A database approach to information retrieval: The remarkable relationship between language models and region models	claim
545	141	Designing and Embedding Reliable Virtual Infrastructures	claim
546	141	Full vectoring optimal power allocation in xDSL channels under per-modem power constraints and spectral mask constraints	claim
547	141	Agnostic Active Learning Without Constraints	claim
548	141	An FPTAS for Bargaining Networks with Unequal Bargaining Powers	claim
549	141	The complexity of linear-time temporal logic over the class of ordinals	claim
550	141	On generalized Frame-Stewart numbers	claim
551	141	The Equivalence of Sampling and Searching	claim
552	141	Learning Functions of Few Arbitrary Linear Parameters in High Dimensions	claim
553	141	Popularity at Minimum Cost	claim
554	141	Modeling Dynamical Influence in Human Interaction Patterns	claim
555	141	A Categorical Outlook on Cellular Automata	claim
556	141	Constructing Quantum Network Coding Schemes from Classical Nonlinear Protocols	claim
557	141	Data Preservation in High Energy Physics - why, how and when?	claim
558	140	Energy Optimization across Training and Data for Multiuser Minimum Sum-MSE Linear Precoding	claim
559	140	Window-Based Greedy Contention Management for Transactional Memory	claim
560	140	An HTTP-Based Versioning Mechanism for Linked Data	claim
561	140	Evaluation of Query Generators for Entity Search Engines	claim
562	140	Performance Evaluation of DCA and SRC on a Single Bot Detection	claim
563	140	An Integrated Framework for Performance Analysis and Tuning in Grid Environment	claim
564	140	Classical BI: Its Semantics and Proof Theory	claim
565	140	Automated Termination Analysis for Logic Programs with Cut	claim
566	140	Dynamic Vehicle Routing for Data Gathering in Wireless Networks	claim
567	140	Refinement Types for Logical Frameworks and Their Interpretation as Proof Irrelevance	claim
568	140	Performance Bounds and Design Criteria for Estimating Finite Rate of Innovation Signals	claim
569	140	Image Segmentation by Discounted Cumulative Ranking on Maximal Cliques	claim
570	140	Joint interpretation of on-board vision and static GPS cartography for determination of correct speed limit	claim
571	140	Decision Problems for Petri Nets with Names	claim
572	140	Coverage games in small cells networks	claim
573	140	On Scaling Laws of Diversity Schemes in Decentralized Estimation	claim
574	140	Scheduling Multi-Mode Real-Time Systems upon Uniform Multiprocessor Platforms	claim
575	140	Soft Control on Collective Behavior of a Group of Autonomous Agents by a Shill Agent	claim
576	140	Runtime-Flexible Multi-dimensional Arrays and Views for C++98 and C++0x	claim
577	140	Construction of New Delay-Tolerant Space-Time Codes	claim
578	139	A finiteness structure on resource terms	claim
579	139	The Complexity of Satisfiability for Sub-Boolean Fragments of ALC	claim
580	139	A proof Procedure for Testing Membership in Regular Expressions	claim
581	139	Information Fusion for Anomaly Detection with the Dendritic Cell Algorithm	claim
582	139	Compromising Tor Anonymity Exploiting P2P Information Leakage	claim
583	139	Link creation and profile alignment in the aNobii social network	claim
584	139	Algorithmic Solutions for Several Offline Constrained Resource Processing and Data Transfer Multicriteria Optimization Problems	claim
585	139	Molecular Communication Using Brownian Motion with Drift	claim
586	139	Pushdown Control-Flow Analysis of Higher-Order Programs	claim
587	139	Fast Overlapping Group Lasso	claim
588	139	Going Green: A Holistic Approach to Transform Business	claim
589	139	A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for Dense MANETs	claim
590	139	The semantic mapping of words and co-words in contexts	claim
591	139	Feedback Capacity of the Gaussian Interference Channel to within 2 Bits	claim
592	139	Centrality Metric for Dynamic Networks	claim
593	139	What's in a crowd? Analysis of face-to-face behavioral networks	claim
594	139	On Communication over Unknown Sparse Frequency-Selective Block-Fading Channels	claim
595	139	Data Cleaning and Query Answering with Matching Dependencies and Matching Functions	claim
596	139	A recombination algorithm for the decomposition of multivariate rational functions	claim
597	139	Ontology and Knowledge Management System on Epilepsy and Epileptic Seizures	claim
598	138	A Logical Temporal Relational Data Model	claim
599	138	ICT in Universities of the Western Himalayan Region of India II: A Comparative SWOT Analysis	claim
600	138	On building minimal automaton for subset matching queries	claim
601	138	Shallow Circuits with High-Powered Inputs	claim
602	138	A Framework for Interactive Work Design based on Digital Work Analysis and Simulation	claim
603	138	Data Stream Clustering: Challenges and Issues	claim
604	138	Optimal Path Planning under Temporal Logic Constraints	claim
605	138	The Digital Signature Scheme MQQ-SIG	claim
606	138	Feedback control logic synthesis for non safe Petri nets	claim
607	138	Rules of Thumb for Information Acquisition from Large and Redundant Data	claim
608	138	Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter	claim
609	137	State Elimination Ordering Strategies: Some Experimental Results	claim
610	137	On broadcast channels with binary inputs and symmetric outputs	claim
611	137	Local algorithms in (weakly) coloured graphs	claim
612	137	Positive Supercompilation for a Higher-Order Call-By-Value Language	claim
613	137	Verification of Java Bytecode using Analysis and Transformation of Logic Programs	claim
614	137	Optimizing real-time RDF data streams	claim
615	137	Open Graphs and Monoidal Theories	claim
616	137	LEXSYS: Architecture and Implication for Intelligent Agent systems	claim
617	137	Quantum interactive proofs with short messages	claim
618	137	Comparing Repository Types - Challenges and barriers for subject-based repositories, research repositories, national repository systems and institutional repositories in serving scholarly comm	claim
619	137	Seamless Flow Migration on Smartphones without Network Support	claim
620	136	On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases	claim
621	136	Max-min Fairness in 802.11 Mesh Networks	claim
622	136	On the Implementation of the Probabilistic Logic Programming Language ProbLog	claim
623	136	A Reflective Approach to Providing Flexibility in Application Distribution	claim
624	136	Detecting Inconsistencies in Large Biological Networks with Answer Set Programming	claim
625	136	Applying Prolog to Develop Distributed Systems	claim
626	136	Optimally Sparse Frames	claim
627	136	Maximum Bipartite Matching Size And Application to Cuckoo Hashing	claim
628	136	NgViz: Detecting DNS Tunnels through N-Gram Visualization and Quantitative Analysis	claim
629	136	Viewpoints: A high-performance high-dimensional exploratory data analysis tool	claim
630	136	Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic	claim
631	136	The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection	claim
632	136	On Optimal Single-Item Auctions	claim
633	136	Schaefer's theorem for graphs	claim
634	136	An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA	claim
635	136	Automatic Image Segmentation by Dynamic Region Merging	claim
636	136	Personalized Data Set for Analysis	claim
637	136	Comparing Prediction Market Structures, With an Application to Market Making	claim
638	135	Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph	claim
639	135	Constant-Weight Gray Codes for Local Rank Modulation	claim
640	135	Bounded Rationality, Strategy Simplification, and Equilibrium	claim
641	135	Automatic derivation of domain terms and concept location based on the analysis of the identifiers	claim
642	135	A stochastic analysis of greedy routing in a spatially-dependent sensor network	claim
643	135	Cryptanalysis of an Elliptic Curve-based Signcryption Scheme	claim
644	135	Fuzzy Aided Application Layer Semantic Intrusion Detection System - FASIDS	claim
645	135	The Power of Nondeterminism in Self-Assembly	claim
646	135	Information Distance	claim
647	135	Optimal Design of a Molecular Recognizer: Molecular Recognition as a Bayesian Signal Detection Problem	claim
648	135	Balanced distribution-energy inequalities and related entropy bounds	claim
649	135	JIT Spraying and Mitigations	claim
650	135	Spreadsheet Refactoring	claim
651	135	Gravitational tree-code on graphics processing units: implementation in CUDA	claim
652	135	Modified EESM Based Link Adaptation Algorithm for Multimedia Transmission in Multicarrier Systems	claim
653	135	The Dichotomy of List Homomorphisms for Digraphs	claim
654	135	On Achievable Rates of the Two-user Symmetric Gaussian Interference Channel	claim
655	135	Stiffness Analysis of Parallel Manipulators with Preloaded Passive Joints	claim
656	135	SABRE: A Tool for Stochastic Analysis of Biochemical Reaction Networks	claim
657	135	Transmit Energy Focusing for DOA Estimation in MIMO Radar with Colocated Antennas	claim
658	135	Top-K Color Queries for Document Retrieval	claim
659	135	Secure Communication and Access Control for Mobile Web Service Provisioning	claim
660	134	Effective Defect Prevention Approach in Software Process for Achieving Better Quality Levels	claim
661	134	On the order bound for one-point AG codes	claim
662	134	Where is Randomness Needed to Break the Square-Root Bottleneck?	claim
663	134	Incremental Sampling-based Algorithms for Optimal Motion Planning	claim
664	134	Dichotic harmony for the musical practice	claim
665	134	Large Margin Multiclass Gaussian Classification with Differential Privacy	claim
666	134	Methods for the Reconstruction of Parallel Turbo Codes	claim
667	134	Hosting Byzantine Fault Tolerant Services on a Chord Ring	claim
668	134	Abstract Certification of Global Non-Interference in Rewriting Logic	claim
669	134	Bit-size estimates for triangular sets in positive dimension	claim
670	134	A Translational Approach to Constraint Answer Set Solving	claim
671	134	The LASSO risk for gaussian matrices	claim
672	134	Locally identifying coloring of graphs	claim
673	133	Scalable, Time-Responsive, Digital, Energy-Efficient Molecular Circuits using DNA Strand Displacement	claim
674	133	PSIM: A tool for analysis of device pairing methods	claim
675	133	Performance evaluation of a new route optimization technique for mobile IP	claim
676	133	Access-Network Association Policies for Media Streaming in Heterogeneous Environments	claim
677	133	Computational efficiency of fractional diffusion using adaptive time step memory	claim
678	133	On Byzantine Containment Properties of the $min+1$ Protocol	claim
679	133	Nonuniform Sparse Recovery with Gaussian Matrices	claim
680	133	Adapting to the Shifting Intent of Search Queries	claim
681	133	Santa Claus Schedules Jobs on Unrelated Machines	claim
682	133	Reformulation of Global Constraints in Answer Set Programming	claim
683	133	Robust Beamforming for Security in MIMO Wiretap Channels with Imperfect CSI	claim
684	132	Caveats for the journal and field normalizations in the CWTS ("Leiden") evaluations of research performance	claim
685	132	Distance Constraint Satisfaction Problems	claim
686	132	Acyclic Solos and Differential Interaction Nets	claim
687	132	Bayesian Network Based XP Process Modelling	claim
688	132	ETP-Mine: An Efficient Method for Mining Transitional Patterns	claim
689	132	Functorial Data Migration	claim
690	132	Small NFAs from Regular Expressions: Some Experimental Results	claim
691	132	Performance of Interference Alignment in Clustered Wireless Ad Hoc Networks	claim
692	132	Calibration and Internal no-Regret with Partial Monitoring	claim
693	132	New Frontiers of Network Security: The Threat Within	claim
694	132	Integrating digital human modeling into virtual environment for ergonomic oriented design	claim
695	132	Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter	claim
696	132	Automated co-evolution of GMF editor models	claim
697	131	Ergodic and Outage Performance of Fading Broadcast Channels with 1-Bit Feedback	claim
698	131	Detecting Botnets Through Log Correlation	claim
699	131	Haptics in computer music : a paradigm shift	claim
700	131	Multimode Control Attacks on Elections	claim
701	131	Mobile Information Collectors' Trajectory Data Warehouse Design	claim
702	131	A PAC-Bayesian Analysis of Graph Clustering and Pairwise Clustering	claim
703	131	A proposed "osi based" network troubles identification model	claim
704	131	Authentication from matrix conjugation	claim
705	131	Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding	claim
706	131	On Modelling and Analysis of Dynamic Reconfiguration of Dependable Real-Time Systems	claim
707	130	Stable Principal Component Pursuit	claim
708	130	Sharp Bounds on the Entropy of the Poisson Law and Related Quantities	claim
709	130	Channel Capacity Limitations versus Hardware Implementation for UWB Impulse Radio Communications	claim
710	130	Linear Sum Capacity for Gaussian Multiple Access Channels with Feedback	claim
711	130	Phase Transitions for Greedy Sparse Approximation Algorithms	claim
712	130	Approximated Structured Prediction for Learning Large Scale Graphical Models	claim
713	130	Towards Adaptable and Adaptive Policy-Free Middleware	claim
714	130	Decomposition of the NVALUE constraint	claim
715	130	Dichotomy for tree-structured trigraph list homomorphism problems	claim
716	130	On Polynomial Multiplication in Chebyshev Basis	claim
717	130	The roundtable: an abstract model of conversation dynamics	claim
718	130	Discrete Partitioning and Coverage Control for Gossiping Robots	claim
719	130	Covered Clause Elimination	claim
720	130	Asymptotic Sum-Capacity of Random Gaussian Interference Networks Using Interference Alignment	claim
721	130	Distribution of Cognitive Load in Web Search	claim
722	130	Fractional Repetition Codes for Repair in Distributed Storage Systems	claim
723	130	Discrete Laplace-Beltrami Operator Determines Discrete Riemannian Metric	claim
724	130	Spectral methods for the detection of network community structure: a comparative analysis	claim
725	130	Interactive Learning Based Realizability and 1-Backtracking Games	claim
726	130	Ontology-based Queries over Cancer Data	claim
727	130	Oblivious Buy-at-Bulk in Planar Graphs	claim
728	129	Performance Analysis and Special Issues of Broadband Strategies in the Computer Communication	claim
729	129	The complexity of positive first-order logic without equality	claim
730	129	Attribute oriented induction with star schema	claim
731	129	ML(n)BiCGStab: Reformulation, Analysis and Implementation	claim
732	129	Estimation in Gaussian Noise: Properties of the Minimum Mean-Square Error	claim
733	129	Understanding periodicity and regularity of nodal encounters in mobile networks: A spectral analysis	claim
734	129	sTeXIDE: An Integrated Development Environment for sTeX Collections	claim
735	128	A Performance Study of GA and LSH in Multiprocessor Job Scheduling	claim
736	128	Partial monoids: associativity and confluence	claim
737	128	Blind Compressed Sensing	claim
738	128	TAGME: on-the-fly annotation of short text fragments (by Wikipedia entities)	claim
739	128	Random Oracles in a Quantum World	claim
740	128	Sublinear Optimization for Machine Learning	claim
741	128	Effect of Inter Packet Delay in performance analysis of coexistence heterogeneous Wireless Packet Networks	claim
742	128	Optimal Auctions with Correlated Bidders are Easy	claim
743	128	Trajectory Codes for Flash Memory	claim
744	127	Statistical and Computational Tradeoffs in Stochastic Composite Likelihood	claim
745	127	Optimisation of a Crossdocking Distribution Centre Simulation Model	claim
746	127	MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems	claim
747	127	Mean field for Markov Decision Processes: from Discrete to Continuous Optimization	claim
748	127	Analysis of Basis Pursuit Via Capacity Sets	claim
749	127	A note on concentration of submodular functions	claim
750	127	Online Algorithms for the Multi-Armed Bandit Problem with Markovian Rewards	claim
751	127	Finite-SNR Diversity-Multiplexing Tradeoff via Asymptotic Analysis of Large MIMO Systems	claim
752	127	Profile Based Sub-Image Search in Image Databases	claim
753	127	Local Optimality of User Choices and Collaborative Competitive Filtering	claim
754	127	Exact Sparse Matrix-Vector Multiplication on GPU's and Multicore Architectures	claim
755	127	Extended core and choosability of a graph	claim
756	127	Channels Reallocation In Cognitive Radio Networks Based On DNA Sequence Alignment	claim
757	127	Precisely Analyzing Loss in Interface Adapter Chains	claim
758	127	Learning Networks of Stochastic Differential Equations	claim
759	127	On Turing machines, dynamical systems and the Atiyah problem	claim
760	127	Towards a communication-theoretic understanding of system-level power consumption	claim
761	127	Complexity of Data Dependence problems for Program Schemas with Concurrency	claim
762	126	Piecewise Certificates of Positivity for matrix polynomials	claim
763	126	Game interpretation of Kolmogorov complexity	claim
764	126	Towards Providing Low-Risk and Economically Feasible Network Data Transfer Services	claim
765	126	Fundamental Limits of Wideband Localization - Part I: A General Framework	claim
766	126	Extending scientific computing system with structural quantum programming capabilities	claim
767	126	The Use of Probabilistic Systems to Mimic the Behaviour of Idiotypic AIS Robot Controllers	claim
768	126	RDFViewS: A Storage Tuning Wizard for RDF Applications	claim
769	126	Well-definedness of Streams by Transformation and Termination	claim
770	126	Automatic Verification of Parametric Specifications with Complex Topologies	claim
771	126	Asymptotic Traffic Flow in an Hyperbolic Network I: Definition and Properties of the Core	claim
772	126	Visibility maintenance via controlled invariance for leader-follower Dubins-like vehicles	claim
773	126	Triangular Self-Assembly	claim
774	126	Computerized adaptive testing: implementation issues	claim
775	126	From Pathwidth to Connected Pathwidth	claim
776	126	Reed Muller Sensing Matrices and the LASSO	claim
777	125	Modeling and Annotating the Expressive Semantics of Dance Videos	claim
778	125	Delay-rate tradeoff for ergodic interference alignment in the Gaussian case	claim
779	125	Iterated Regret Minimization in Game Graphs	claim
780	125	Critical control of a genetic algorithm	claim
781	125	Comments on Five Smart Card Based Password Authentication Protocols	claim
782	125	Local search for stable marriage problems with ties and incomplete lists	claim
783	125	Tree Languages Defined in First-Order Logic with One Quantifier Alternation	claim
784	125	Near-Optimal Bayesian Active Learning with Noisy Observations	claim
785	125	Avoiding another Green Elephant - A Proposal for the Next Generation HLA based on the Model Driven Architecture	claim
786	124	Dense Error Correction for Low-Rank Matrices via Principal Component Pursuit	claim
787	124	Feature Level Fusion of Face and Fingerprint Biometrics	claim
788	124	Mimicking the Behaviour of Idiotypic AIS Robot Controllers Using Probabilistic Systems	claim
789	124	Integer-Forcing Linear Receivers	claim
790	124	Quantum Three-Pass protocol: Key distribution using quantum superposition states	claim
791	124	Displacement Calculus	claim
792	124	Online Learning of Noisy Data with Kernels	claim
793	124	Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity	claim
794	124	Component Evolution in General Random Intersection Graphs	claim
795	124	On Omega Context Free Languages which are Borel Sets of Infinite Rank	claim
796	124	A New Framework for Join Product Skew	claim
797	124	Detecting Danger: The Dendritic Cell Algorithm	claim
798	124	Symmetry within and between solutions	claim
799	124	Link Graph Analysis for Adult Images Classification	claim
800	124	A New SLNR-based Linear Precoding for Downlink Multi-User Multi-Stream MIMO Systems	claim
801	124	Lattice model refinement of protein structures	claim
802	124	Property Testing via Set-Theoretic Operations	claim
803	123	Approximate Testing Equivalence Based on Time, Probability, and Observed Behavior	claim
804	123	Mutual Information of IID Complex Gaussian Signals on Block Rayleigh-faded Channels	claim
805	123	Integrating Innate and Adaptive Immunity for Intrusion Detection	claim
806	123	Improved Direct Product Theorems for Randomized Query Complexity	claim
807	123	Segmentation of Natural Images by Texture and Boundary Compression	claim
808	123	Loop Formulas for Description Logic Programs	claim
809	123	A Peer-to-Peer Middleware Framework for Resilient Persistent Programming	claim
810	123	Feature Construction for Relational Sequence Learning	claim
811	123	Partially ordered secretaries	claim
812	123	A Stackelberg Strategy for Routing Flow over Time	claim
813	123	Information Delivery System through Bluetooth in Ubiquitous Networks	claim
814	123	openPC : a toolkit for public cluster with full ownership	claim
815	123	Equilibria of Dynamic Games with Many Players: Existence, Approximation, and Market Structure	claim
816	122	How to meet asynchronously (almost) everywhere	claim
817	122	Collision Helps - Algebraic Collision Recovery for Wireless Erasure Networks	claim
818	122	Harvesting Collective Intelligence: Temporal Behavior in Yahoo Answers	claim
819	122	A Unified Algorithmic Framework for Multi-Dimensional Scaling	claim
820	122	Capacity Region of Gaussian MIMO Broadcast Channels with Common and Confidential Messages	claim
821	122	Specifying Reusable Components	claim
822	122	Open-Ended Evolutionary Robotics: an Information Theoretic Approach	claim
823	122	Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems	claim
824	122	Optimum Power and Rate Allocation for Coded V-BLAST: Average Optimization	claim
825	122	Mathematical Modeling of Competition in Sponsored Search Market	claim
826	122	RoboCast: Asynchronous Communication in Robot Networks	claim
827	122	Evolving Graph Representation and Visualization	claim
828	122	Two-Way Transmission Capacity of Wireless Ad-hoc Networks	claim
829	122	Communication model of emuStudio emulation platform	claim
830	122	Scientific Collaborations: principles of WikiBridge Design	claim
831	122	Manipulating Multistage Interconnection Networks Using Fundamental Arrangements	claim
832	122	Parameterized Complexity of Generalized Domination Problems on Bounded Tree-Width Graphs	claim
833	122	Concavity of Mutual Information Rate for Input-Restricted Finite-State Memoryless Channels at High SNR	claim
834	121	GNSS-based positioning: Attacks and Countermeasures	claim
835	121	Asynchronous Bounded Expected Delay Networks	claim
836	121	Simulation vs. Equivalence	claim
837	121	Symmetric Allocations for Distributed Storage	claim
838	121	System Virtualization and Efficient ID Transmission Method for RFID Tag Infrastructure Network	claim
839	121	Interference Channel with an Out-of-Band Relay	claim
840	121	Mechanism Design via Correlation Gap	claim
841	121	MiniAgda: Integrating Sized and Dependent Types	claim
842	121	A Framework for Constraint-Based Deployment and Autonomic Management of Distributed Applications	claim
843	121	Universal Rate-Efficient Scalar Quantization	claim
844	121	Deep Self-Taught Learning for Handwritten Character Recognition	claim
845	120	State machine models of timing and circuit design	claim
846	120	How Much Multiuser Diversity is Required for Energy Limited Multiuser Systems?	claim
847	120	Dynamical issues in interactive representation of physical objects	claim
848	120	Modeling of 2D and 3D Assemblies Taking Into Account Form Errors of Plane Surfaces	claim
849	120	Implementing Distributed Controllers for Systems with Priorities	claim
850	120	When Feedback Doubles the Prelog in AWGN Networks	claim
851	120	Typicality Graphs:Large Deviation Analysis	claim
852	120	Advances in the Biomedical Applications of the EELA Project	claim
853	120	LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations	claim
854	119	Graph-Constrained Group Testing	claim
855	119	Detecting Danger: Applying a Novel Immunological Concept to Intrusion Detection Systems	claim
856	119	Dynamic Policy Programming	claim
857	119	Report on the XBase Project	claim
858	119	Ergodic Secret Alignment	claim
859	119	Computational Complexity of Avalanches in the Kadanoff two-dimensional Sandpile Model	claim
860	119	Using Information Theory to Study the Efficiency and Capacity of Computers and Similar Devices	claim
861	119	On Probabilistic Parallel Programs with Process Creation and Synchronisation	claim
862	119	Effective complexity of stationary process realizations	claim
863	118	The Citation Field of Evolutionary Economics	claim
864	118	Toward a Formal Semantics for Autonomic Components	claim
865	118	Automatically Discovering Hidden Transformation Chaining Constraints	claim
866	118	A Multiprocessor Communication Architecture For High Speed Networks	claim
867	118	A view of canonical extension	claim
868	118	Asymptotic Traffic Flow in an Hyperbolic Network II: Non-uniform Traffic	claim
869	118	alphaCertified: certifying solutions to polynomial systems	claim
870	118	Large scale probabilistic available bandwidth estimation	claim
871	118	Orthogonal Persistence Revisited	claim
872	118	Estimating Probabilities in Recommendation Systems	claim
873	117	Optimal Reverse Carpooling Over Wireless Networks - A Distributed Optimization Approach	claim
874	117	Relay Assisted Cooperative OSTBC Communication with SNR Imbalance and Channel Estimation Errors	claim
875	117	Node Disjoint Multipath Routing Considering Link and Node Stability protocol: A characteristic Evaluation	claim
876	117	SMEmail - A New Protocol for the Secure E-mail in Mobile Environments	claim
877	117	Stability of Reeb graphs under function perturbations: the case of closed curves	claim
878	117	Evolution with Drifting Targets	claim
879	117	Scientific Workflow Applications on Amazon EC2	claim
880	117	Testing and Debugging Techniques for Answer Set Solver Development	claim
881	117	Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs	claim
882	117	Semantic Query Optimisation with Ontology Simulation	claim
883	117	Reductions Between Expansion Problems	claim
884	117	The Study State Analysis of Tandem Queue with Blocking and Feedback	claim
885	117	An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance	claim
886	117	Evaluating Modelling Approaches for Medical Image Annotations	claim
887	116	Dist-Orc: A Rewriting-based Distributed Implementation of Orc with Formal Analysis	claim
888	116	Estimation with Random Linear Mixing, Belief Propagation and Compressed Sensing	claim
889	116	Gaussian MIMO Broadcast Channels with Common and Confidential Messages	claim
890	116	Adaptive Bound Optimization for Online Convex Optimization	claim
891	116	Heuristics in Conflict Resolution	claim
892	116	Multi-View Active Learning in the Non-Realizable Case	claim
893	116	Arithmetic circuits: the chasm at depth four gets wider	claim
894	116	Where are the hard manipulation problems?	claim
895	116	LiquidXML: Adaptive XML Content Redistribution	claim
896	116	Interference Alignment as a Rank Constrained Rank Minimization	claim
897	116	Restricted Isometries for Partial Random Circulant Matrices	claim
898	116	Contact processes and moment closure on adaptive networks	claim
899	116	Convergent discrete Laplace-Beltrami operators over surfaces	claim
900	116	Automatic Performance Debugging of SPMD Parallel Programs	claim
901	116	Progressive Decoding for Data Availability and Reliability in Distributed Networked Storage	claim
902	116	Managing Delegation in Access Control Models	claim
903	116	Balanced Interval Coloring	claim
904	116	Simulating Cyber-Attacks for Fun and Profit	claim
905	116	New Results on the Capacity of the Gaussian Cognitive Interference Channel	claim
906	116	Mixed-Membership Stochastic Block-Models for Transactional Networks	claim
907	115	Optimal topological simplification of discrete functions on surfaces	claim
908	115	Online Cake Cutting	claim
909	115	The complexity of solving reachability games using value and strategy iteration	claim
910	115	Broadcasting with an Energy Harvesting Rechargeable Transmitter	claim
911	115	Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements	claim
912	115	Approximately achieving Gaussian relay network capacity with lattice codes	claim
913	115	Fundamental Rate-Reliability-Complexity Limits in Outage Limited MIMO Communications	claim
914	115	Novel Mechanism to Defend DDoS Attacks Caused by Spam	claim
915	115	Argudas: arguing with gene expression information	claim
916	115	A strong direct product theorem for two-way public coin communication complexity	claim
917	114	On the Stability of Empirical Risk Minimization in the Presence of Multiple Risk Minimizers	claim
918	114	Sequential Compressed Sensing	claim
919	114	Integrating identity-based cryptography in IMS service authentication	claim
920	114	Settling the Polynomial Learnability of Mixtures of Gaussians	claim
921	114	Montage: a grid portal and software toolkit for science-grade astronomical image mosaicking	claim
922	114	Secure Lossy Source Coding with Side Information at the Decoders	claim
923	114	Stochastic Minority on Graphs	claim
924	114	Computational Complexity of Iterated Maps on the Interval	claim
925	114	On weakly optimal partitions in modular networks	claim
926	114	Efficiently Discovering Hammock Paths from Induced Similarity Networks	claim
927	114	On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms	claim
928	114	Secure Communication over Parallel Relay Channel	claim
929	114	Counting Unique-Sink Orientations	claim
930	113	Traffic Capacity of Large WDM Passive Optical Networks	claim
931	113	A two-step fusion process for multi-criteria decision applied to natural hazards in mountains	claim
932	113	Opaque sets	claim
933	113	Exposing Application Components as Web Services	claim
934	113	Game semantics for first-order logic	claim
935	113	A Fair and Efficient Packet Scheduling Scheme for IEEE 802.16 Broadband Wireless Access Systems	claim
936	113	Multi-core: Adding a New Dimension to Computing	claim
937	113	Gaussian Broadcast Channels with an Orthogonal and Bidirectional Cooperation Link	claim
938	113	Simulated Annealing for Location Area Planning in Cellular networks	claim
939	113	A Strategy to enable Prefix of Multicast VoD through dynamic buffer allocation	claim
940	112	Cooperative Automated Worm Response and Detection Immune Algorithm	claim
941	112	Type-Safe Feature-Oriented Product Lines	claim
942	112	Doubly Perfect Nonlinear Boolean Permutations	claim
943	112	Data security in mobile devices by geo locking	claim
944	112	Approximation Algorithms for Dominating Set in Disk Graphs	claim
945	112	Little Dragon Two: An efficient Multivariate Public Key Cryptosystem	claim
946	112	Transdichotomous Results in Computational Geometry, II: Offline Search	claim
947	112	On Finding Frequent Patterns in Event Sequences	claim
948	112	Colour Guided Colour Image Steganography	claim
949	112	Efficient Approximation of Optimal Control for Markov Games	claim
950	112	Negative Interactions in Irreversible Self-Assembly	claim
951	112	An Empirical Study of Borda Manipulation	claim
952	112	Optimal Distributed Online Prediction using Mini-Batches	claim
953	111	A Tight Bound on the Performance of a Minimal-Delay Joint Source-Channel Coding Scheme	claim
954	111	Directional Dynamics along Arbitrary Curves in Cellular Automata	claim
955	111	Recognition and translation Arabic-French of Named Entities: case of the Sport places	claim
956	111	Towards Public Key Infrastructure less authentication in Session Initiation Protocol	claim
957	111	Coordination and Bargaining over the Gaussian Interference Channel	claim
958	111	Submodular Maximization by Simulated Annealing	claim
959	111	Improved complexity bounds for real root isolation using Continued Fractions	claim
960	111	Reducing the Number of Annotations in a Verification-oriented Imperative Language	claim
961	111	Tight Bounds for Mixing of the Swendsen-Wang Algorithm at the Potts Transition Point	claim
962	111	Rigidity of Graph Joins and Hendrickson's Conjecture	claim
963	111	Error Exponent for Multiple-Access Channels:Lower Bounds	claim
964	111	Analysis Of Cancer Omics Data In A Semantic Web Framework	claim
965	111	Calibration for Ultrasound Breast Tomography Using Matrix Completion	claim
966	110	Mixing Time and Stationary Expected Social Welfare of Logit Dynamics	claim
967	110	Improving Term Extraction Using Particle Swarm Optimization Techniques	claim
968	110	Real-Time Alert Correlation with Type Graphs	claim
969	110	(Unconditional) Secure Multiparty Computation with Man-in-the-middle Attacks	claim
970	110	Detecting communities of triangles in complex networks using spectral optimization	claim
971	110	Advanced Software Protection Now	claim
972	110	Time Critical Social Mobilization: The DARPA Network Challenge Winning Strategy	claim
973	110	Construction of Rational Surfaces Yielding Good Codes	claim
974	110	Predicting the Impact of Measures Against P2P Networks on the Transient Behaviors	claim
975	110	Usability Meets Instant Gratification on the Semantic Web	claim
976	110	Learning Multi-modal Similarity	claim
977	110	Provenance and evidence in UniProtKB	claim
978	109	Dirty Paper Coding using Sign-bit Shaping and LDPC Codes	claim
979	109	Cuspidal and Noncuspidal Robot Manipulators	claim
980	109	Fast space-variant elliptical filtering using box splines	claim
981	109	Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity	claim
982	109	Experimenting with Innate Immunity	claim
983	109	Oil Price Trackers Inspired by Immune Memory	claim
984	109	Polynomial Learning of Distribution Families	claim
985	109	An Ontology-based Context Aware System for Selective Dissemination of Information in a Digital Library	claim
986	109	Towards the Development of a Simulator for Investigating the Impact of People Management Practices on Retail Performance	claim
987	109	Fast simulation of large-scale growth models	claim
988	109	Reputation-Based Attack-Resistant Cooperation Stimulation (RACS) For Mobile Ad hoc Networks	claim
989	109	Hybrid tractability of soft constraint problems	claim
990	109	Pairwise Optimal Discrete Coverage Control for Gossiping Robots	claim
991	109	Equilibrium Pricing of Digital Goods via a New Market Model	claim
992	109	Edge Preserving Image Denoising in Reproducing Kernel Hilbert Spaces	claim
993	109	Tight lower bounds for the size of epsilon-nets	claim
994	108	Constraint solvers: An empirical evaluation of design decisions	claim
995	108	Mining The Successful Binary Combinations: Methodology and A Simple Case Study	claim
996	108	Using Coloured Petri Nets for design of parallel raytracing environment	claim
997	108	Generalized Secure Distributed Source Coding with Side Information	claim
998	108	Born to be Wild: Using Communities of Practice as a Tool for Knowledge Management	claim
999	108	Compressed Sensing: How sharp is the Restricted Isometry Property	claim
1000	108	On Graphs and Codes Preserved by Edge Local Complementation	claim
1001	108	Inverting a permutation is as hard as unordered search	claim
1002	108	An Analysis of Transaction and Joint-patent Application Networks	claim
1003	108	Securing data transfer in the cloud through introducing identification packet and UDT-authentication option field: a characterization	claim
1004	108	Sum-Capacity and the Unique Separability of the Parallel Gaussian MAC-Z-BC Network	claim
1005	108	Service Level Agreement (SLA) in Utility Computing Systems	claim
1006	108	Recursive Definitions of Monadic Functions	claim
1007	108	Affine Invariant, Model-Based Object Recognition Using Robust Metrics and Bayesian Statistics	claim
1008	108	Finding Cycles and Trees in Sublinear Time	claim
1009	107	Towards Effective Sentence Simplification for Automatic Processing of Biomedical Text	claim
1010	107	The Influence of Intensity Standardization on Medical Image Registration	claim
1011	107	A tight quantitative version of Arrow's impossibility theorem	claim
1012	107	Sparse Multipath Channel Estimation Using Compressive Sampling Matching Pursuit Algorithm	claim
1013	107	Duality and canonical extensions for stably compact spaces	claim
1014	107	mVideoCast: Mobile, real time ROI detection and streaming	claim
1015	107	Fast GPGPU Data Rearrangement Kernels using CUDA	claim
1016	107	Maximum Betweenness Centrality: Approximability and Tractable Cases	claim
1017	107	Yacc is dead	claim
1018	107	Distributed Detection over Time Varying Networks: Large Deviations Analysis	claim
1019	107	Metric uniformization and spectral bounds for graphs	claim
1020	107	One-Shot Capacity of Discrete Channels	claim
1021	107	The E8 Lattice and Error Correction in Multi-Level Flash Memory	claim
1022	106	The WebContent XML Store	claim
1023	106	Further Exploration of the Dendritic Cell Algorithm: Antigen Multiplier and Time Windows	claim
1024	106	Spatial logics with connectedness predicates	claim
1025	106	A security framework for SOA applications in mobile environment	claim
1026	106	Symmetry within Solutions	claim
1027	106	MDPs with Unawareness	claim
1028	106	Real Time and Energy Efficient Transport Protocol for Wireless Sensor Networks	claim
1029	106	Controlling program extraction in Elementary Linear Logic	claim
1030	106	Scheduling in Parallel Queues with Randomly Varying Connectivity and Switchover Delay	claim
1031	106	Lombardi Drawings of Graphs	claim
1032	106	Temporal Logics on Words with Multiple Data Values	claim
1033	106	Learning Residual Finite-State Automata Using Observation Tables	claim
1034	106	Simulation of Computer Network Attacks	claim
1035	106	On disjoint paths in acyclic planar graphs	claim
1036	106	Simulating space and time	claim
1037	106	Optimal measures and transition kernels	claim
1038	106	Random road networks: the quadtree model	claim
1039	106	Deduction as Reduction	claim
1040	105	A framework to model real-time databases	claim
1041	105	A multivalued knowledge-base model	claim
1042	105	The Impact of Topology on Byzantine Containment in Stabilization	claim
1043	105	Nominal Unification from a Higher-Order Perspective	claim
1044	105	Online Identification and Tracking of Subspaces from Highly Incomplete Information	claim
1045	105	Molecular Recognition as an Information Channel: The Role of Conformational Changes	claim
1046	105	Human Speed-Accuracy Tradeoffs in Search	claim
1047	105	Fuzzy Controller for Matrix Converter System to Improve its Quality of Output	claim
1048	105	Exact Shortest Path Queries for Planar Graphs Using Linear Space	claim
1049	105	The Networked Common Goods Game	claim
1050	105	Optimism in Reinforcement Learning Based on Kullback-Leibler Divergence	claim
1051	105	On Designing Multicore-aware Simulators for Biological Systems	claim
1052	105	Universal and Robust Distributed Network Codes	claim
1053	104	Support Recovery of Sparse Signals	claim
1054	104	Offline Signature Identification by Fusion of Multiple Classifiers using Statistical Learning Theory	claim
1055	104	Approximating the minimum directed tree cover	claim
1056	104	A new proof of Nash's Theorem via exchangeable equilibria	claim
1057	104	Algorithmic Aspects of Golomb Ruler Construction	claim
1058	104	Empirical learning aided by weak domain knowledge in the form of feature importance	claim
1059	104	Does Treewidth Help in Modal Satisfiability?	claim
1060	104	An Optimal Lower Bound for Buffer Management in Multi-Queue Switches	claim
1061	104	Coloring translates and homothets of a convex body	claim
1062	104	Decentralised Learning MACs for Collision-free Access in WLANs	claim
1063	104	Heuristic approach to optimize the number of test cases for simple circuits	claim
1064	104	Distributed Successive Approximation Coding using Broadcast Advantage: The Two-Encoder Case	claim
1065	104	The Use of Scientific Data: A Content Analysis	claim
1066	104	Testing by C++ template metaprograms	claim
1067	104	FreePub: Collecting and Organizing Scientific Material Using Mindmaps	claim
1068	104	Concatenated Polar Codes	claim
1069	104	Machine Science in Biomedicine: Practicalities, Pitfalls and Potential	claim
1070	104	Designing Incentive Schemes Based on Intervention: The Case of Imperfect Monitoring	claim
1071	103	Asymptotic Learning Curve and Renormalizable Condition in Statistical Learning Theory	claim
1072	103	Improved Approximation for Guarding Simple Galleries from the Perimeter	claim
1073	103	"Mind your p's and q's": or the peregrinations of an apostrophe in 17th Century English	claim
1074	103	Securing Internet Protocol (IP) Storage: A Case Study	claim
1075	103	Approximately Optimal Mechanism Design via Differential Privacy	claim
1076	103	Spatially-Adaptive Reconstruction in Computed Tomography Based on Statistical Learning	claim
1077	103	Exploratory Analysis of Functional Data via Clustering and Optimal Segmentation	claim
1078	103	On the Finite Time Convergence of Cyclic Coordinate Descent Methods	claim
1079	103	Defuzzification Method for a Faster and More Accurate Control	claim
1080	103	Efficient Resource Matching in Heterogeneous Grid Using Resource Vector	claim
1081	103	Random Information Spread in Networks	claim
1082	103	On Graph Crossing Number and Edge Planarization	claim
1083	103	Probabilistic regular graphs	claim
1084	103	Robust Matrix Decomposition with Outliers	claim
1085	103	Structural Solutions to Dynamic Scheduling for Multimedia Transmission in Unknown Wireless Environments	claim
1086	103	BioBlender: a Software for Intuitive Representation of Surface Properties of Biomolecules	claim
1087	103	On the Queueing Behavior of Random Codes over a Gilbert-Elliot Erasure Channel	claim
1088	103	Complexity of Multi-Value Byzantine Agreement	claim
1089	103	Least Squares Superposition Codes of Moderate Dictionary Size, Reliable at Rates up to Capacity	claim
1090	103	k-Independent Gaussians Fool Polynomial Threshold Functions	claim
1091	102	States and exceptions are dual effects	claim
1092	102	Detecting Weak but Hierarchically-Structured Patterns in Networks	claim
1093	102	Outage Probability of General Ad Hoc Networks in the High-Reliability Regime	claim
1094	102	On the Design of Efficient CSMA Algorithms for Wireless Networks	claim
1095	102	How to prevent type-flaw and multi-protocol attacks on security protocols under Exclusive-OR	claim
1096	102	MIREX: MapReduce Information Retrieval Experiments	claim
1097	102	A Data Warehouse Assistant Design System Based on Clover Model	claim
1098	102	How frequently is a system of 2-linear Boolean equations solvable?	claim
1099	102	Error Analysis of Approximated PCRLBs for Nonlinear Dynamics	claim
1100	102	From RESTful Services to RDF: Connecting the Web and the Semantic Web	claim
1101	102	On Flat Polyhedra deriving from Alexandrov's Theorem	claim
1102	102	Structure of random r-SAT below the pure literal threshold	claim
1103	102	Stable Takens' Embeddings for Linear Dynamical Systems	claim
1104	102	Modeling biological systems with delays in Bio-PEPA	claim
1105	102	On Factor Universality in Symbolic Spaces	claim
1106	102	The impact of cell site re-homing on the performance of umts core networks	claim
1107	102	ChemCloud: Chemical e-Science Information Cloud	claim
1108	102	A contribution to the conditioning of the total least squares problem	claim
1109	102	Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard Walks	claim
1110	101	Computing the Least Fixed Point of Positive Polynomial Systems	claim
1111	101	Model-Driven Constraint Programming	claim
1112	101	Bounds for binary codes relative to pseudo-distances of k points	claim
1113	101	Finite Optimal Control for Time-Bounded Reachability in CTMDPs and Continuous-Time Markov Games	claim
1114	101	Distributed anonymous discrete function computation	claim
1115	101	A Multi-agent Framework for Performance Tuning in Distributed Environment	claim
1116	101	Construction and Applications of CRT Sequences	claim
1117	101	Probing Capacity	claim
1118	101	On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes	claim
1119	101	Circuits with arbitrary gates for random operators	claim
1120	101	Online Learning: Random Averages, Combinatorial Parameters, and Learnability	claim
1121	101	Universal Loop-Free Super-Stabilization	claim
1122	101	Spectrum Sharing as Spatial Congestion Games	claim
1123	101	Binary is Good: A Binary Inference Framework for Primary User Separation in Cognitive Radio Networks	claim
1124	100	Fast-Group-Decodable STBCs via Codes over GF(4)	claim
1125	100	The Projected GSURE for Automatic Parameter Tuning in Iterative Shrinkage Methods	claim
1126	100	Radio Interface for High Data Rate Wireless Sensor Networks	claim
1127	100	Products of Weighted Logic Programs	claim
1128	100	Convex Relaxations for Subset Selection	claim
1129	100	Shortest paths between shortest paths and independent sets	claim
1130	100	General Model for Single and Multiple Channels WLANs with Quality of Service Support	claim
1131	100	Mining Knowledge in Astrophysical Massive Data Sets	claim
1132	100	A New Proof of the F5 Algorithm	claim
1133	100	Secret Key Generation for a Pairwise Independent Network Model	claim
1134	100	Real-Time Sorting of Binary Numbers on One-Dimensional CA	claim
1135	100	Discovering Knowledge from Multi-modal Lecture Recordings	claim
1136	100	Twitter mood predicts the stock market	claim
1137	99	Pure Type Systems without Explicit Contexts	claim
1138	99	A New Phase Transition for Local Delays in MANETs	claim
1139	99	Security Scheme for Distributed DoS in Mobile Ad Hoc Networks	claim
1140	99	Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits	claim
1141	99	An Automated Algorithm for Approximation of Temporal Video Data Using Linear B'EZIER Fitting	claim
1142	99	Locating phase transitions in computationally hard problems	claim
1143	99	Similarity Analysis and Modeling in Mobile Societies: The Missing Link	claim
1144	99	INDECT Advanced Security Requirements	claim
1145	99	MIMO Identical Eigenmode Transmission System (IETS) - A Channel Decomposition Perspective	claim
1146	99	Intersection Theory for Generic Differential Polynomials and Differential Chow Form	claim
1147	99	On Equivalence Between Network Topologies	claim
1148	99	Efficient Matrix Completion with Gaussian Models	claim
1149	99	On Functional Decomposition of Multivariate Polynomials with Differentiation and Homogenization	claim
1150	99	Filter Bank Fusion Frames	claim
1151	99	A Markov Chain Model for the Analysis of Round-Robin Scheduling Scheme	claim
1152	99	Session Types = Intersection Types + Union Types	claim
1153	99	How I won the "Chess Ratings - Elo vs the Rest of the World" Competition	claim
1154	98	Linear Operator Channels over Finite Fields	claim
1155	98	Quantum Online Memory Checking	claim
1156	98	Strategical languages of infinite words	claim
1157	98	Maximal Intersection Queries in Randomized Input Models	claim
1158	98	A Fast Approach to Creative Telescoping	claim
1159	98	Multi-sensorial interaction with a nano-scale phenomenon : the force curve	claim
1160	98	Analog Matching of Colored Sources to Colored Channels	claim
1161	98	Extended Computation Tree Logic	claim
1162	98	Efficient Sketches for the Set Query Problem	claim
1163	98	On the number of simple arrangements of five double pseudolines	claim
1164	98	Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs	claim
1165	98	Structure-Aware Stochastic Control for Transmission Scheduling	claim
1166	98	Fast Self-Stabilizing Minimum Spanning Tree Construction	claim
1167	98	Circle Packing for Origami Design Is Hard	claim
1168	98	Scheduling with Rate Adaptation under Incomplete Knowledge of Channel/Estimator Statistics	claim
1169	98	Coding for High-Density Recording on a 1-D Granular Magnetic Medium	claim
1170	98	Satisfaction Equilibrium: A General Framework for QoS Provisioning in Self-Configuring Networks	claim
1171	98	Local Computation: Lower and Upper Bounds	claim
1172	97	Congruence from the Operator's Point of View: Compositionality Requirements on Process Semantics	claim
1173	97	Knowledge-Based Innovation Systems and the Model of a Triple Helix of University-Industry-Government Relations	claim
1174	97	Bulking II: Classifications of Cellular Automata	claim
1175	97	Cryptanalysis of an Efficient Signcryption Scheme with Forward Secrecy Based on Elliptic Curve	claim
1176	97	The finite-dimensional Witsenhausen counterexample	claim
1177	97	A Linear-time Algorithm for Sparsification of Unweighted Graphs	claim
1178	97	Bin Packing via Discrepancy of Permutations	claim
1179	97	Analysis of a Splitting Estimator for Rare Event Probabilities in Jackson Networks	claim
1180	97	Continuation-Passing C, compiling threads to events through continuations	claim
1181	97	Towards a Collision-Free WLAN: Dynamic Parameter Adjustment in CSMA/E2CA	claim
1182	97	On the Scaling Law for Compressive Sensing and its Applications	claim
1183	96	The theory and calculus of aliasing	claim
1184	96	On the Non-Coherent Wideband Multipath Fading Relay Channel	claim
1185	96	Linear Capacity Scaling in Wireless Networks: Beyond Physical Limits?	claim
1186	96	Common Frame of reference in collaborative virtual environments and their impact on presence	claim
1187	96	Truth and Envy in Capacitated Allocation Games	claim
1188	96	The Complexity of Partition Functions on Hermitian Matrices	claim
1189	96	Strong Fault-Tolerance for Self-Assembly with Fuzzy Temperature	claim
1190	96	Learning High-Dimensional Markov Forest Distributions: Analysis of Error Rates	claim
1191	96	LSMR: An iterative algorithm for sparse least-squares problems	claim
1192	96	Geometry of abstraction in quantum computation	claim
1193	96	Linguistic complexity: English vs. Polish, text vs. corpus	claim
1194	96	The System Kato: Detecting Cases of Plagiarism for Answer-Set Programs	claim
1195	96	Examining Requirements Change Rework Effort: A Study	claim
1196	96	Recovering randomness from an asymptotic Hamming distance	claim
1197	96	Realizing evaluation strategies by hierarchical graph rewriting	claim
1198	96	On Optimal Deadlock Detection Scheduling	claim
1199	96	Rate-distortion function via minimum mean square error estimation	claim
1200	96	Parameterized Complexity Results in Symmetry Breaking	claim
1201	96	Construction of Codes for Network Coding	claim
1202	96	A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm	claim
1203	96	A Simple Correctness Proof for Magic Transformation	claim
1204	96	Stable comparison of multidimensional persistent homology groups with torsion	claim
1205	96	Quantifying Information Leakage in Finite Order Deterministic Programs	claim
1206	95	Causality and the Semantics of Provenance	claim
1207	95	Spectral Properties of the Threshold Network Model	claim
1208	95	Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold	claim
1209	95	Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial	claim
1210	95	A Generic Storage API	claim
1211	95	Performance evaluation for ML sequence detection in ISI channels with Gauss Markov Noise	claim
1212	95	A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid	claim
1213	95	Evaluating Call-By-Need on the Control Stack	claim
1214	95	Optimization and Convergence of Observation Channels in Stochastic Control	claim
1215	95	Statistical Compressive Sensing of Gaussian Mixture Models	claim
1216	95	A lower bound for the tree-width of planar graphs with vital linkages	claim
1217	95	Nowhere dense graph classes, stability, and the independence property	claim
1218	95	M-Banking Security - a futuristic improved security approach	claim
1219	95	Approximation in quantale-enriched categories	claim
1220	95	Towards an incremental maintenance of cyclic association rules	claim
1221	95	Single-Call Mechanisms	claim
1222	95	From Holant To #CSP And Back: Dichotomy For Holant$^c$ Problems	claim
1223	95	When are feedforward microcircuits well-modeled by maximum entropy methods?	claim
1224	95	Incidence structures from the blown up plane and LDPC codes	claim
1225	94	Discovery of Convoys in Trajectory Databases	claim
1226	94	Unidirectional Error Correcting Codes for Memory Systems: A Comparative Study	claim
1227	94	Geometric reconstruction from point-normal data	claim
1228	94	Symmetric M-tree	claim
1229	94	An Enhanced Search Technique for Managing Partial Coverage and Free Riding in P2P Networks	claim
1230	94	Information-theoretic Capacity of Clustered Random Networks	claim
1231	94	Complexity dichotomy on partial grid recognition	claim
1232	94	Is Content Publishing in BitTorrent Altruistic or Profit-Driven	claim
1233	94	Quantization of Discrete Probability Distributions	claim
1234	94	Is Witsenhausen's counterexample a relevant toy?	claim
1235	94	Optimal Bangla Keyboard Layout using Association Rule of Data Mining	claim
1236	94	Real-Time Multi-path Tracking of Probabilistic Available Bandwidth	claim
1237	94	Tight Sample Complexity of Large-Margin Learning	claim
1238	94	The Power of Simple Tabulation Hashing	claim
1239	94	Dynamic Observers for Fault Diagnosis of Timed Systems	claim
1240	94	When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings	claim
1241	94	Multi-Objective Genetic Programming Projection Pursuit for Exploratory Data Modeling	claim
1242	94	Particle Swarm Optimization Based Diophantine Equation Solver	claim
1243	94	Segmented compressed sampling for analog-to-information conversion: Method and performance analysis	claim
1244	94	The Stability of Low-Rank Matrix Reconstruction: a Constrained Singular Value View	claim
1245	94	Addressing the Challenge of Distributed Interactive Simulation With Data Distribution Service	claim
1246	94	Using virtual human for an interactive customer-oriented constrained environment design	claim
1247	94	Partitions and Coverings of Trees by Bounded-Degree Subtrees	claim
1248	94	On the number of solutions of the discretizable molecular distance geometry problem	claim
1249	93	Optimal Cooperative Relaying Schemes for Improving Wireless Physical Layer Security	claim
1250	93	A Key Distribution Scheme for Sensor Networks Using Structured Graphs	claim
1251	93	Macro and micro view on steady states in state space	claim
1252	93	On MMSE and MAP Denoising Under Sparse Representation Modeling Over a Unitary Dictionary	claim
1253	93	Rank Awareness in Joint Sparse Recovery	claim
1254	93	Group-Strategyproof Irresolute Social Choice Functions	claim
1255	93	Randomness for Free	claim
1256	93	Support for Evolving Software Architectures in the ArchWare ADL	claim
1257	93	Injective colorings of graphs with low average degree	claim
1258	93	Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes	claim
1259	93	Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory	claim
1260	93	Scalable XML Collaborative Editing with Undo short paper	claim
1261	93	An Adaptive Multi-channel P2P Video-on-Demand System using Plug-and-Play Helpers	claim
1262	93	Correlated Resource Models of Internet End Hosts	claim
1263	93	Generalized roof duality and bisubmodular functions	claim
1264	93	Multicast Capacity Scaling of Wireless Networks with Multicast Outage	claim
1265	93	Alternatives to Mobile Keypad Design: Improved Text Feed	claim
1266	92	On Network-Error Correcting Convolutional Codes under the BSC Edge Error Model	claim
1267	92	Outage Efficient Strategies for Network MIMO with Partial CSIT	claim
1268	92	Performance Investigation of Virtual Private Networks with Different Bandwidth Allocations	claim
1269	92	Spatial multiplexing with MMSE receivers: Single-stream optimality in ad hoc networks	claim
1270	92	The Complexity of Finding Reset Words in Finite Automata	claim
1271	92	Extremal graphs for the identifying code problem	claim
1272	92	Efficient System-Enforced Deterministic Parallelism	claim
1273	92	Exact counting of Euler Tours for generalized series-parallel graphs	claim
1274	92	Applying Constraint Solving to the Management of Distributed Applications	claim
1275	92	Parameterizing by the Number of Numbers	claim
1276	92	Design and Modeling Billing solution to Next Generation Networks	claim
1277	92	Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold Functions	claim
1278	92	On Packing Colorings of Distance Graphs	claim
1279	92	How Do Emerging Technologies Conquer the World? An Exploration of Patterns of Diffusion and Network Formation	claim
1280	92	Promoting Component Reuse by Separating Transmission Policy from Implementation	claim
1281	92	Network Intrusion Detection Using FP Tree Rules	claim
1282	92	Random Projections for $k$-means Clustering	claim
1283	92	Benchmarking triple stores with biological data	claim
1284	92	Regression on fixed-rank positive semidefinite matrices: a Riemannian approach	claim
1285	92	Energy-Efficient Precoding for Multiple-Antenna Terminals	claim
1286	92	Preference Elicitation in Prioritized Skyline Queries	claim
1287	91	Information Asymmetries in Pay-Per-Bid Auctions: How Swoopo Makes Bank	claim
1288	91	Structure of Extreme Correlated Equilibria	claim
1289	91	Ultrametric watersheds: a bijection theorem for hierarchical edge-segmentation
1290	91	A Separation of NP and coNP in Multiparty Communication Complexity	claim
1291	91	Invariance properties of the multidimensional matching distance in Persistent Topology and Homology	claim
1292	91	Simulations of Weighted Tree Automata	claim
1293	91	Verifiable Network-Performance Measurements	claim
1294	91	Fundamental Limits of Wideband Localization - Part II: Cooperative Networks	claim
1295	91	List Decodability at Small Radii	claim
1296	91	Shadowing Effects on Routing Protocol of Multihop Ad Hoc Networks	claim
1297	91	Tata Kelola Database Perguruan Tinggi Yang Optimal Dengan Data Warehouse	claim
1298	91	Joint space and workspace analysis of a two-DOF closed-chain manipulator	claim
1299	91	TSDS: high-performance merge, subset, and filter software for time series-like data	claim
1300	91	Switching between Hidden Markov Models using Fixed Share	claim
1301	90	Two-Domain DNA Strand Displacement	claim
1302	90	New Criteria for Iterative Decoding	claim
1303	90	RFID Applications: An Introductory and Exploratory Study	claim
1304	90	Table manipulation in simplicial databases	claim
1305	90	Logical complexity of graphs: a survey	claim
1306	90	Multi-Unit Auctions: Beyond Roberts	claim
1307	90	No embedding of the automorphisms of a topological space into a compact metric space endows them with a composition that passes to the limit	claim
1308	90	New Constant-Weight Codes from Propagation Rules	claim
1309	90	Uncertainty Principles and Balian-Low type Theorems in Principal Shift-Invariant Spaces	claim
1310	90	On the Optimality of Successive Decoding in Compress-and-Forward Relay Schemes	claim
1311	90	Upward Point-Set Embeddability	claim
1312	90	Level Shifter Design for Low Power Applications	claim
1313	90	On Constructive Connectives and Systems	claim
1314	90	AMP: A Science-driven Web-based Application for the TeraGrid	claim
1315	90	A student's guide to searching the literature using online databases	claim
1316	90	An Upper Bound on Multi-hop Transmission Capacity with Dynamic Multipath Routing	claim
1317	90	Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing	claim
1318	90	Fast Pseudo-Random Fingerprints	claim
1319	90	Process Makna - A Semantic Wiki for Scientific Workflows	claim
1320	90	Performance evaluation of parallel manipulators for milling application	claim
1321	90	Multiparty Equality Function Computation in Networks with Point-to-Point Links	claim
1322	90	A Deterministic Equivalent Approach to the Performance Analysis of Isometric Random Precoded Systems	claim
1323	89	Closed nominal rewriting and efficiently computable nominal algebra equality	claim
1324	89	The capacity region of a class of broadcast channels with a sequence of less noisy receivers	claim
1325	89	Distributed Control of the Laplacian Spectral Moments of a Network	claim
1326	89	Collaborative Filtering in a Non-Uniform World: Learning with the Weighted Trace Norm	claim
1327	89	LPKI - A Lightweight Public Key Infrastructure for the Mobile Environments	claim
1328	89	Coding objects related to Catalan numbers	claim
1329	89	Involutive Categories and Monoids, with a GNS-correspondence	claim
1330	89	The SIMO Pre-Log Can Be Larger Than the SISO Pre-Log	claim
1331	89	An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity	claim
1332	89	SHIELD: Social sensing and Help In Emergency using mobiLe Devices	claim
1333	89	A Framework For Fully-Simulatable h-Out-Of-n Oblivious Transfer	claim
1334	89	Power optimized programmable embedded controller	claim
1335	89	Some Theorems on the Algorithmic Approach to Probability Theory and Information Theory	claim
1336	89	A Microwave Imaging and Enhancement Technique from Noisy Synthetic Data	claim
1337	89	Yet another aperiodic tile set	claim
1338	88	Network Codes Resilient to Jamming and Eavesdropping	claim
1339	88	A fuzzified BRAIN algorithm for learning DNF from incomplete data	claim
1340	88	libtissue - implementing innate immunity	claim
1341	88	Unbeatable Imitation	claim
1342	88	Optimal (v, 4, 2, 1) optical orthogonal codes with small parameters	claim
1343	88	Kinematic modelling of a 3-axis NC machine tool in linear and circular interpolation	claim
1344	88	Communication and Round Efficient Information Checking Protocol	claim
1345	88	A characterization of b-perfect graphs	claim
1346	88	On Regret of Parametric Mismatch in Minimum Mean Square Error Estimation	claim
1347	88	On the Proximity Factors of Lattice Reduction-Aided Decoding	claim
1348	88	Dynamic and Transparent Analysis of Commodity Production Systems	claim
1349	88	Spectrum of Sizes for Perfect Deletion-Correcting Codes	claim
1350	88	Multiple Timescale Dispatch and Scheduling for Stochastic Reliability in Smart Grids with Wind Generation Integration	claim
1351	88	Function and form of gestures in a collaborative design meeting	claim
1352	88	Grothendieck inequalities for semidefinite programs with rank constraint	claim
1353	88	Architectural Support for Global Smart Spaces	claim
1354	88	SPARQL Assist Language-Neutral Query Composer	claim
1355	88	Infinite Time Cellular Automata: A Real Computation Model	claim
1356	88	The CALBC RDF Triple Store: retrieval over large literature content	claim
1357	87	Testing Reactive Probabilistic Processes	claim
1358	87	Equational Characterization of Covariant-Contravariant Simulation and Conformance Simulation Semantics	claim
1359	87	Roberts' Theorem with Neutrality: A Social Welfare Ordering Approach	claim
1360	87	Security Issues in the Optimized Link State Routing Protocol Version 2 (OLSRV2)	claim
1361	87	Publishing and Discovery of Mobile Web Services in Peer to Peer Networks	claim
1362	87	Quantum money from knots	claim
1363	87	Using Evolution Strategy with Meta-models for Well Placement Optimization	claim
1364	87	An Algorithm for the Graph Crossing Number Problem	claim
1365	87	Cusp points in the parameter space of RPR-2PRR parallel manipulator	claim
1366	86	Matching with Couples Revisited	claim
1367	86	Online Scheduling on Identical Machines using SRPT	claim
1368	86	Modelling Variability for System Families	claim
1369	86	Secure Multiparty Computation with Partial Fairness	claim
1370	86	Introduction to Xgrid: Cluster Computing for Everyone	claim
1371	86	Time-Symmetric Cellular Automata	claim
1372	86	Characterizing Structure Through Shape Matching and Applications to Self Assembly	claim
1373	85	Generic design of Chinese remaindering schemes	claim
1374	85	A Unified Algebraic Framework for Fuzzy Image Compression and Mathematical Morphology	claim
1375	85	Partial Denominator Bounds for Partial Linear Difference Equations	claim
1376	85	The Lambek-Grishin calculus is NP-complete	claim
1377	85	An Effective Extension of the Wagner Hierarchy to Blind Counter Automata	claim
1378	85	Tensor sparsification via a bound on the spectral norm of random tensors	claim
1379	85	When Knowing Early Matters: Gossip, Percolation and Nash Equilibria	claim
1380	85	The Motif Tracking Algorithm	claim
1381	85	Vertex Sparsifiers and Abstract Rounding Algorithms	claim
1382	85	A Single-Instance Incremental SAT Formulation of Proof- and Counterexample-Based Abstraction	claim
1383	85	A control-theoretical methodology for the scheduling problem	claim
1384	85	Pushing BitTorrent Locality to the Limit	claim
1385	85	Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability	claim
1386	85	Characterization and definability in modal first-order fragments	claim
1387	85	Practical Constructions for the Efficient Cryptographic Enforcement of Interval-Based Access Control Policies	claim
1388	85	Rancangan Infrastruktur E-Bisnis Business Intelligence Pada Perguruan Tinggi	claim
1389	85	Attack--Defense Trees and Two-Player Binary Zero-Sum Extensive Form Games Are Equivalent	claim
1390	84	On some invariants in numerical semigroups and estimations of the order bound	claim
1391	84	An Achievable Rate for the MIMO Individual Channel	claim
1392	84	Constructing Active Architectures in the ArchWare ADL	claim
1393	84	On the Security of Non-Linear HB (NLHB) Protocol Against Passive Attack	claim
1394	84	Left-Inverses of Fractional Laplacian and Sparse Stochastic Processes	claim
1395	84	Outage Probability for Multi-Cell Processing under Rayleigh Fading	claim
1396	84	The set of realizations of a max-plus linear sequence is semi-polyhedral	claim
1397	84	Medians and means in Finsler geometry	claim
1398	84	Improved Inapproximability For Submodular Maximization	claim
1399	84	Rewriting and Well-Definedness within a Proof System	claim
1400	84	Termination Casts: A Flexible Approach to Termination with General Recursion	claim
1401	84	Performance Analysis of QoS in PMP Mode WiMax Networks	claim
1402	84	A Robust Beamformer Based on Weighted Sparse Constraint	claim
1403	83	Grammatical Aspects for Language Descriptions	claim
1404	83	Recursive Secret Sharing for Distributed Storage and Information Hiding	claim
1405	83	Sentence Simplification Aids Protein-Protein Interaction Extraction	claim
1406	83	Inertial tolerancing and capability indices in an assembly production	claim
1407	83	Key distribution in PKC through Quantas	claim
1408	83	Multi-Agent Simulation and Management Practices	claim
1409	83	Breaking the Legend: Maxmin Fairness notion is no longer effective	claim
1410	83	Investigating the Performance of an Adiabatic Quantum Optimization Processor	claim
1411	83	Swapping Evaluation: A Memory-Scalable Solution for Answer-On-Demand Tabling	claim
1412	83	Utility Constrained Energy Minimization In Aloha Networks	claim
1413	83	A Platform for Implementing Secure Wireless Ad Hoc Networks	claim
1414	83	Multitriangulations, pseudotriangulations and primitive sorting networks	claim
1415	83	Flat Zipper-Unfolding Pairs for Platonic Solids	claim
1416	83	List Factoring and Relative Worst Order Analysis	claim
1417	83	Throughput-Optimal Random Access with Order-Optimal Delay	claim
1418	83	MT4j - A Cross-platform Multi-touch Development Framework	claim
1419	83	Mixed Cumulative Distribution Networks	claim
1420	83	Faster Query Answering in Probabilistic Databases using Read-Once Functions	claim
1421	82	Self-Selected or Mandated, Open Access Increases Citation Impact for Higher Quality Research	claim
1422	82	Removing Local Extrema from Imprecise Terrains	claim
1423	82	Encryption Quality Analysis and Security Evaluation of CAST-128 Algorithm and its Modified Version using Digital Images	claim
1424	82	Spying the World from your Laptop -- Identifying and Profiling Content Providers and Big Downloaders in BitTorrent	claim
1425	82	Capacity Theorems for the AWGN Multi-Way Relay Channel	claim
1426	82	Secret Sharing and Proactive Renewal of Shares in Hierarchical Groups	claim
1427	82	Expansion and Search in Networks	claim
1428	82	Accountable Anonymous Group Messaging	claim
1429	82	Client-to-Client Streaming Scheme for VOD Applications	claim
1430	82	The zero exemplar distance problem	claim
1431	82	A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model	claim
1432	82	Computing (or not) Quasi-Periodicity Functions of Tilings	claim
1433	82	Secret-key Agreement with Channel State Information at the Transmitter	claim
1434	82	Lower Bounds for the Smoothed Number of Pareto optimal Solutions	claim
1435	81	Multiarray Signal Processing: Tensor decomposition meets compressed sensing	claim
1436	81	Relaxation-based coarsening and multiscale graph organization	claim
1437	81	Self-stabilization with Byzantine tolerance for global tasks	claim
1438	81	Using machine learning to make constraint solver implementation decisions	claim
1439	81	On the size of identifying codes in triangle-free graphs	claim
1440	81	Understanding Cascading Failures in Power Grids	claim
1441	81	Exploring Grid Polygons Online	claim
1442	81	Influence of distortions of key frames on video transfer in wireless networks	claim
1443	81	Analysis of Agglomerative Clustering	claim
1444	81	Enumerating randoms	claim
1445	80	Equilibrium and Termination	claim
1446	80	Multi-path Probabilistic Available Bandwidth Estimation through Bayesian Active Learning	claim
1447	80	Fault Diagnosis with Dynamic Observers	claim
1448	80	Many-to-Many Graph Matching: a Continuous Relaxation Approach	claim
1449	80	Cooperative Secret Communication with Artificial Noise in Symmetric Interference Channel	claim
1450	80	Separations of Matroid Freeness Properties	claim
1451	80	New Set of Codes for the Maximum-Likelihood Decoding Problem	claim
1452	80	High-Throughput Random Access via Codes on Graphs	claim
1453	80	Analysis of temporal characteristics of the editorial processing in scientific periodicals	claim
1454	80	Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence	claim
1455	79	Safe Recursion on Notation into a Light Logic by Levels	claim
1456	79	Quantitative Games on Probabilistic Timed Automata	claim
1457	79	Enhancing Privacy for Biometric Identification Cards	claim
1458	79	Variable elimination for building interpreters	claim
1459	79	A Multi-hop Multi-source Algebraic Watchdog	claim
1460	79	For the sake of simplicity: Unsupervised extraction of lexical simplifications from Wikipedia	claim
1461	79	Random Topologies and the emergence of cooperation: the role of short-cuts	claim
1462	79	Providing Data Group Anonymity Using Concentration Differences	claim
1463	79	Semantics of a Typed Algebraic Lambda-Calculus	claim
1464	79	An Optimal Coding Strategy for the Binary Multi-Way Relay Channel	claim
1465	79	Sampling of operators	claim
1466	79	Probabilistic cellular automata, invariant measures, and perfect sampling	claim
1467	78	IR-UWB Channel Capacity for Analog and Mostly Digital Implementation	claim
1468	78	On an Outer bound and an Inner Bound for the General Broadcast Channel	claim
1469	78	Collision Codes: Decoding Superimposed BPSK Modulated Wireless Transmissions	claim
1470	78	Flow-Cut Gaps for Integer and Fractional Multiflows	claim
1471	78	On the Iterated Hairpin Completion	claim
1472	78	Outage rates and outage durations of opportunistic relaying systems	claim
1473	78	Optimizing Computation of Recovery Plans for BPEL Applications	claim
1474	77	Stochastic Analysis of Non-slotted Aloha in Wireless Ad-Hoc Networks	claim
1475	77	Triangular Decomposition of Semi-algebraic Systems	claim
1476	77	On Secure Distributed Data Storage Under Repair Dynamics	claim
1477	77	Sound Bisimulations for Higher-Order Distributed Process Calculus	claim
1478	77	Optimization of transport protocols with path-length constraints in complex networks	claim
1479	77	Pattern Classification In Symbolic Streams via Semantic Annihilation of Information	claim
1480	77	A Proximity based Retransmission Scheme for Power Line Ad-hoc LAN	claim
1481	77	Decreasing log data of multi-tier services for effective request tracing	claim
1482	77	The Binary-Symmetric Parallel-Relay Network	claim
1483	77	On MMSE Properties and I-MMSE Implications in Parallel MIMO Gaussian Channels	claim
1484	77	An upper bound on the number of states for a strongly universal hyperbolic cellular automaton on the pentagrid	claim
1485	77	Reduced ML-Decoding Complexity, Full-Rate STBCs for $2^a$ Transmit Antenna Systems	claim
1486	77	LinBox founding scope allocation, parallel building blocks, and separate compilation	claim
1487	77	Community Structure in the United Nations General Assembly	claim
1488	77	Implicit Renewal Theory and Power Tails on Trees	claim
1489	77	Regularized Risk Minimization by Nesterov's Accelerated Gradient Methods: Algorithmic Extensions and Empirical Studies	claim
1490	76	Unitary Noise and the Mermin-GHZ Game	claim
1491	76	Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies	claim
1492	76	Fusion Discrete Logarithm Problems	claim
1493	76	Nonadaptive quantum query complexity	claim
1494	76	An analysis of a war-like card game	claim
1495	76	Study of Reconfigurable Mostly Digital Radio for Manet	claim
1496	76	Quantale Modules and their Operators, with Applications	claim
1497	76	Improved Bounds on Restricted Isometry Constants for Gaussian Matrices	claim
1498	76	Reconstruction of complete interval tournaments	claim
1499	76	Query Strategies for Evading Convex-Inducing Classifiers	claim
1500	76	Queue Length Asymptotics for Generalized Max-Weight Scheduling in the presence of Heavy-Tailed Traffic	claim
1501	76	A new muscle fatigue and recovery model and its ergonomics application in human simulation	claim
1502	76	Introducing Automated Regression Testing in Open Source Projects	claim
1503	76	A framework for designing concurrent and recoverable abstract data types based on commutativity	claim
1504	76	Power Control with Imperfect Exchanges and Applications to Spectrum Sharing	claim
1505	76	Freezing and Sleeping: Tracking Experts that Learn by Evolving Past Posteriors	claim
1506	75	An Optimal Family of Exponentially Accurate One-Bit Sigma-Delta Quantization Schemes	claim
1507	75	Optimal control theory : a method for the design of wind instruments	claim
1508	75	Extended Range Telepresence for Evacuation Training in Pedestrian Simulations	claim
1509	75	Inference with minimal Gibbs free energy in information field theory	claim
1510	75	Explicit Evidence Systems with Common Knowledge	claim
1511	75	Rankers over Infinite Words	claim
1512	75	Linear Algebra in the vector space of intervals	claim
1513	75	Notes on higher-dimensional tarai functions	claim
1514	75	Network coding with modular lattices	claim
1515	75	Dense Error-Correcting Codes in the Lee Metric	claim
1516	75	Treemaps with Bounded Aspect Ratio	claim
1517	74	Formats of Winning Strategies for Six Types of Pushdown Games	claim
1518	74	Cascade and Triangular Source Coding with Side Information at the First Two Nodes	claim
1519	74	A note on the random greedy triangle-packing algorithm	claim
1520	74	Conflict-Free Coloring and its Applications	claim
1521	74	RAFDA: Middleware Supporting the Separation of Application Logic from Distribution Policy	claim
1522	74	Data Partitioning for Parallel Entity Matching	claim
1523	74	Significance of Classification Techniques in Prediction of Learning Disabilities	claim
1524	74	Scalar-linear Solvability of Matroidal Networks Associated with Representable Matroids	claim
1525	74	A new tool for the performance analysis of massively parallel computer systems	claim
1526	73	Coinductive subtyping for abstract compilation of object-oriented languages into Horn formulas	claim
1527	73	On Touching Triangle Graphs	claim
1528	73	Exponential Family Hybrid Semi-Supervised Learning	claim
1529	73	Privacy Issues of the W3C Geolocation API	claim
1530	73	On the Impact of the Migration Topology on the Island Model	claim
1531	73	Lossy compression of discrete sources via Viterbi algorithm	claim
1532	73	The Surprise Examination Paradox and the Second Incompleteness Theorem	claim
1533	73	Spectrally degenerate graphs: Hereditary case	claim
1534	73	Target tracking in the recommender space: Toward a new recommender system based on Kalman filtering	claim
1535	73	Should one compute the Temporal Difference fix point or minimize the Bellman Residual? The unified oblique projection view	claim
1536	73	Parikh's Theorem: A simple and direct construction	claim
1537	73	A Parameterized Centrality Metric for Network Analysis	claim
1538	72	Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)	claim
1539	72	Fixed point theorem and aperiodic tilings	claim
1540	72	The Burbea-Rao and Bhattacharyya centroids
1541	72	Porting Decision Tree Algorithms to Multicore using FastFlow	claim
1542	72	Fast Moment Estimation in Data Streams in Optimal Space	claim
1543	72	Sequential Rationality in Cryptographic Protocols	claim
1544	72	Rebuilding for Array Codes in Distributed Storage Systems	claim
1545	72	Privately Releasing Conjunctions and the Statistical Query Barrier	claim
1546	72	Minimizing weighted sum delay for one-to-many file transfer in peer-to-peer networks	claim
1547	72	Construction of Short Protocol Sequences with Worst-Case Throughput Guarantee	claim
1548	72	Simple Cellular Automata-Based Linear Models for the Shrinking Generator	claim
1549	72	A Generalized Sampling Theorem for Reconstructions in Arbitrary Bases	claim
1550	72	Gang FTP scheduling of periodic and parallel rigid real-time tasks	claim
1551	72	Exploring Simple Triangular and Hexagonal Grid Polygons Online	claim
1552	72	X-Armed Bandits	claim
1553	71	On the Expressiveness of Markovian Process Calculi with Durational and Durationless Actions	claim
1554	71	The relational model is injective for Multiplicative Exponential Linear Logic (without weakenings)	claim
1555	71	Start-phase control of distributed systems written in Erlang/OTP	claim
1556	71	An Agent-based Simulation of the Effectiveness of Creative Leadership	claim
1557	71	Sampled Semantics of Timed Automata	claim
1558	71	Cobham's theorem for substitutions	claim
1559	71	Multiscale approach for the network compression-friendly ordering	claim
1560	71	Equality, Quasi-Implicit Products, and Large Eliminations	claim
1561	71	On Various Negative Translations	claim
1562	71	Rational Convex Programs, Their Feasibility, and the Arrow-Debreu Nash Bargaining Game	claim
1563	71	Distributed Verification and Hardness of Distributed Approximation	claim
1564	70	The Deterministic Dendritic Cell Algorithm	claim
1565	70	Augmented Rotation-Based Transformation for Privacy-Preserving Data Clustering	claim
1566	70	Structured sparsity-inducing norms through submodular functions	claim
1567	70	Web Conferencing Traffic - An Analysis using DimDim as Example	claim
1568	70	Simultaneous communication in noisy channels	claim
1569	70	Bounded Reachability for Temporal Logic over Constraint Systems	claim
1570	70	A Generalized Coupon Collector Problem	claim
1571	70	Computation in Large-Scale Scientific and Internet Data Applications is a Focus of MMDS 2010	claim
1572	70	Bulk File Download Throughput in a Single Station WLAN with Nonzero Propagation Delay	claim
1573	69	Stochastic Calculus of Wrapped Compartments	claim
1574	69	Matching Shapes Using the Current Distance	claim
1575	69	The WebStand Project	claim
1576	69	From Playability to a Hierarchical Game Usability Model	claim
1577	69	A Geometric View of Conjugate Priors	claim
1578	69	Using a Kernel Adatron for Object Classification with RCS Data	claim
1579	69	A simple model for the evolution of molecular codes driven by the interplay of accuracy, diversity and cost	claim
1580	69	Epistemic irrelevance in credal nets: the case of imprecise Markov trees	claim
1581	69	Efficient Knowledge Base Management in DCSP	claim
1582	69	Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time	claim
1583	69	Towards Optimal Bayesian Algorithmic Mechanism Design	claim
1584	69	The Isomorphism Relation Between Tree-Automatic Structures	claim
1585	69	Extending INET Framework for Directional and Asymmetrical Wireless Communications	claim
1586	69	On the enumeration of d-minimal permutations	claim
1587	69	Emoticonsciousness	claim
1588	69	Embedding a Forest in a Graph	claim
1589	68	Comparative Study of Protocols Used for Establishing VPN	claim
1590	68	Johnson-Lindenstrauss lemma for circulant matrices	claim
1591	68	Is It Real, or Is It Randomized?: A Financial Turing Test	claim
1592	68	On Probabilistic Alternating Simulations	claim
1593	68	Polymatroids with Network Coding	claim
1594	68	Indoor Positioning with Radio Location Fingerprinting	claim
1595	68	On the Rationality of Escalation	claim
1596	68	A basic gesture and motion format for virtual reality multisensory applications	claim
1597	68	Snap-Stabilizing Linear Message Forwarding	claim
1598	68	Can Random Coin Flips Speed Up a Computer?	claim
1599	68	A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Non-negative Weights	claim
1600	68	Algorithms for Comparing Pedigree Graphs	claim
1601	68	An Optimization for Reasoning with Forest Logic Programs	claim
1602	68	A framework to experiment optimizations for real-time and embedded software	claim
1603	68	Position Modulation Code for Rewriting Write-Once Memories	claim
1604	68	Communicating Under Channel Uncertainty	claim
1605	68	Confluence Reduction for Probabilistic Systems (extended version)	claim
1606	67	Using ATL to define advanced and flexible constraint model transformations	claim
1607	67	Profile Popularity in a Business-oriented Online Social Network	claim
1608	67	From Frequency to Meaning: Vector Space Models of Semantics	claim
1609	67	Rate Regions of Secret Key Sharing in a New Source Model	claim
1610	67	Virtual Texturing	claim
1611	67	From granular avalanches to fluid turbulences through oozing pastes. A mesoscopic physically-based particle model	claim
1612	67	Transfer Entropy on Rank Vectors	claim
1613	67	Similarity-based Reasoning in Qualified Logic Programming	claim
1614	67	Sustaining the Internet with Hyperbolic Mapping	claim
1615	67	Learning Latent Tree Graphical Models	claim
1616	67	Life-Cycles and Mutual Effects of Scientific Communities	claim
1617	67	Maintaining Virtual Areas on FPGAs using Strip Packing with Delays	claim
1618	67	An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles	claim
1619	67	Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract)	claim
1620	67	Tau Be or not Tau Be? - A Perspective on Service Compatibility and Substitutability	claim
1621	67	Secret Sharing LDPC Codes for the Constrained Gaussian Wiretap Channel	claim
1622	67	Covering Cubes and the Closest Vector Problem	claim
1623	67	Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic	claim
1624	66	The space of measurement outcomes as a spectrum for non-commutative algebras	claim
1625	66	On the Capacity of Non-Coherent Network Coding	claim
1626	66	A Simple Message-Passing Algorithm for Compressed Sensing	claim
1627	66	Solutions to the GSM Security Weaknesses	claim
1628	66	Polyominoes Simulating Arbitrary-Neighborhood Zippers and Tilings	claim
1629	66	On Extractors and Exposure-Resilient Functions for Sublogarithmic Entropy	claim
1630	66	Price Trackers Inspired by Immune Memory	claim
1631	66	Query strategy for sequential ontology debugging	claim
1632	66	The great trinomial hunt	claim
1633	66	Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems	claim
1634	66	Highly Parallel Sparse Matrix-Matrix Multiplication	claim
1635	66	Design and Implementation VOIP Service on Open IMS and Asterisk Servers Interconnected through Enum Server	claim
1636	66	Heapable Sequences and Subsequences	claim
1637	66	New Common Proper-Motion Pairs From the PPMX Catalog	claim
1638	66	Efficient Dealiased Convolutions without Padding	claim
1639	66	The overlap number of a graph	claim
1640	66	Certifying cost annotations in compilers	claim
1641	66	Implications of Inter-Rater Agreement on a Student Information Retrieval Evaluation	claim
1642	66	A Partial Taxonomy of Substitutability and Interchangeability	claim
1643	66	Eigenvalue Results for Large Scale Random Vandermonde Matrices with Unit Complex Entries	claim
1644	66	Analysis of dependence among size, rate and duration in internet flows	claim
1645	66	Morphonette: a morphological network of French	claim
1646	66	Non-Sparse Regularization and Efficient Training with Multiple Kernels	claim
1647	66	Three-Level Parallel J-Jacobi Algorithms for Hermitian Matrices	claim
1648	66	A Unique "Nonnegative" Solution to an Underdetermined System: from Vectors to Matrices	claim
1649	65	Structural Decomposition of Reactions of Graph-Like Objects	claim
1650	65	Statistical properties of subgroups of free groups	claim
1651	65	Finding and counting vertex-colored subtrees	claim
1652	65	Fishing in Poisson streams: focusing on the whales, ignoring the minnows	claim
1653	65	Offline Handwriting Recognition using Genetic Algorithm	claim
1654	65	Modelling Immunological Memory	claim
1655	65	Online Event Segmentation in Active Perception using Adaptive Strong Anticipation	claim
1656	65	A Theory of Network Equivalence	claim
1657	65	Efficient Computation of Optimal Trading Strategies	claim
1658	65	On Unconditionally Secure Computation with Vanishing Communication Cost	claim
1659	65	Iterative method for improvement of coding and decryption	claim
1660	65	An Information Flow Architecture for Global Smart Spaces	claim
1661	65	Generating Bijections between HOAS and the Natural Numbers	claim
1662	65	Transmitting Video-on-Demand Effectively	claim
1663	65	Reward and cooperation in the spatial public goods game	claim
1664	65	Are SNOMED CT Browsers Ready for Institutions? Introducing MySNOM	claim
1665	65	A Note on Solid Coloring of Pure Simplicial Complexes	claim
1666	65	Uniqueness of models in persistent homology: the case of curves	claim
1667	65	Feedback Vertex Set in Mixed Graphs	claim
1668	65	Evolutionary Games defined at the Network Mesoscale: The Public Goods game	claim
1669	64	Using Strategy Improvement to Stay Alive	claim
1670	64	State Complexity of Testing Divisibility	claim
1671	64	Efficient Upload Bandwidth Estimation and Communication Resource Allocation Techniques	claim
1672	64	Proposing a New Method for Query Processing Adaption in DataBase	claim
1673	64	Cop and robber games when the robber can hide and ride	claim
1674	64	Dominion -- A constraint solver generator	claim
1675	64	High-Dimensional Matched Subspace Detection When Data are Missing	claim
1676	64	A Trustability Metric for Code Search based on Developer Karma	claim
1677	64	Near-Optimal Evasion of Convex-Inducing Classifiers	claim
1678	64	Controlled non uniform random generation of decomposable structures	claim
1679	64	Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix	claim
1680	64	Dominance in the family of Sugeno-Weber t-norms	claim
1681	64	Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP	claim
1682	64	Selfish Response to Epidemic Propagation	claim
1683	64	On the Complexity of Real Root Isolation	claim
1684	64	Measurable Stochastics for Brane Calculus	claim
1685	64	Satisfiability of Elastic Demand in the Smart Grid	claim
1686	64	First Smart Spaces	claim
1687	64	Opinion fluctuations and disagreement in social networks	claim
1688	64	Dual Formulations of Mixed Finite Element Methods	claim
1689	64	Divide-and-conquer: Approaching the capacity of the two-pair bidirectional Gaussian relay network	claim
1690	64	A Spatial-Epistemic Logic for Reasoning about Security Protocols	claim
1691	63	Simplifying Parallelization of Scientific Codes by a Function-Centric Approach in Python	claim
1692	63	Position Analysis of the RRP-3(SS) Multi-Loop Spatial Structure	claim
1693	63	On the meaning of the h-index	claim
1694	63	Learning from Logged Implicit Exploration Data	claim
1695	63	Psychophysiological Correlations with Gameplay Experience Dimensions	claim
1696	63	XQ2P: Efficient XQuery P2P Time Series Processing	claim
1697	63	Bugs in the proofs of revelation principle	claim
1698	63	Impact of degree heterogeneity on the behavior of trapping in Koch networks	claim
1699	63	On Opinion Dynamics in Heterogeneous Networks	claim
1700	63	Forecast Bias Correction: A Second Order Method	claim
1701	63	Simplified Distributed Programming with Micro Objects	claim
1702	63	Robust Vacuity for Branching Temporal Logic	claim
1703	63	From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking	claim
1704	63	Bifix codes and Sturmian words	claim
1705	63	Multiple-access Network Information-flow and Correction Codes	claim
1706	63	Dynamic Knowledge Capitalization through Annotation among Economic Intelligence Actors in a Collaborative Environment	claim
1707	63	Subject reduction in a Curry-style polymorphic type system with a vectorial structure	claim
1708	62	How do we remember the past in randomised strategies?	claim
1709	62	Decisional Processes with Boolean Neural Network: the Emergence of Mental Schemes	claim
1710	62	Random Access to Grammar Compressed Strings	claim
1711	62	Genetic algorithm for robotic telescope scheduling	claim
1712	62	Interconnection between 802.15.4 Devices and IPv6: Implications and Existing Approaches	claim
1713	62	Information embedding meets distributed control	claim
1714	62	Twenty Questions Games Always End With Yes	claim
1715	62	Public-key cryptography in functional programming context	claim
1716	62	Views, Program Transformations, and the Evolutivity Problem	claim
1717	62	Sequence prediction in realizable and non-realizable cases	claim
1718	62	On Infinitary Rational Relations and Borel Sets	claim
1719	62	A Derandomized Sparse Johnson-Lindenstrauss Transform	claim
1720	62	FPGA Based Assembling of Facial Components for Human Face Construction	claim
1721	62	Guessing Revisited: A Large Deviations Approach	claim
1722	62	Applications of semidefinite programming to coding theory	claim
1723	62	Portability of Prolog programs: theory and case-studies	claim
1724	62	Asymptotically-Good, Multigroup ML-Decodable STBCs	claim
1725	62	Pure Saddle Points and Symmetric Relative Payoff Games	claim
1726	62	YeastMed: an XML-Based System for Biological Data Integration of Yeast	claim
1727	62	Spectra of Modular and Small-World Matrices	claim
1728	62	A semantic approach for the requirement-driven discovery of web services in the Life Sciences	claim
1729	62	The McEliece Cryptosystem Resists Quantum Fourier Sampling Attacks	claim
1730	62	Short quantum games characterize PSPACE	claim
1731	61	Approximate Privacy: PARs for Set Problems	claim
1732	61	Optimization of Multiple Vehicle Routing Problems using Approximation Algorithms	claim
1733	61	Utility and Privacy of Data Sources: Can Shannon Help Conceal and Reveal Information?	claim
1734	61	An Improved DC Recovery Method from AC Coefficients of DCT-Transformed Images	claim
1735	61	Trends and Techniques in Visual Gaze Analysis	claim
1736	61	A weakly stable algorithm for general Toeplitz systems	claim
1737	61	Local versus Global Search in Channel Graphs	claim
1738	61	Relating Sequent Calculi for Bi-intuitionistic Propositional Logic	claim
1739	61	Spatial fairness in linear wireless multi-access networks	claim
1740	61	Tracking a Threshold Crossing Time of a Gaussian Random Walk Through Correlated Observations	claim
1741	61	The Conceptual Integration Modeling Framework: Abstracting from the Multidimensional Model	claim
1742	60	Contracting the Facebook API	claim
1743	60	Multiple Access Network Information-flow And Correction codes	claim
1744	60	"Compressed" Compressed Sensing	claim
1745	60	Spectral properties of the Google matrix of the World Wide Web and other directed networks	claim
1746	60	A Novel Scheme for Secured Data Transfer Over Computer Networks	claim
1747	60	A Concrete Representation of Observational Equivalence for PCF	claim
1748	60	A Very Simple Approach for 3-D to 2-D Mapping	claim
1749	60	A Note on Integer Factorization Using Lattices	claim
1750	60	Hypersurfaces with degenerate duals and the Geometric Complexity Theory Program	claim
1751	60	Ackermann and Primitive-Recursive Bounds with Dickson's Lemma	claim
1752	60	Computing with Equations	claim
1753	60	Hitting time results for Maker-Breaker games	claim
1754	60	IMITATOR II: A Tool for Solving the Good Parameters Problem in Timed Automata	claim
1755	60	Self-Inverse Interleavers for Turbo Codes	claim
1756	60	Matrix Coherence and the Nystrom Method	claim
1757	60	Parallel versions of the symbolic manipulation system FORM	claim
1758	60	Behavioural Models for Group Communications	claim
1759	60	Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization	claim
1760	60	Dialectica Interpretation with Marked Counterexamples	claim
1761	60	Symmetry Breaking for Answer Set Programming	claim
1762	60	An introduction to finite automata and their connection to logic	claim
1763	60	Stiffness modelling of parallelogram-based parallel manipulators	claim
1764	60	Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform so well over the BEC	claim
1765	60	Small But Slow World: How Network Topology and Burstiness Slow Down Spreading	claim
1766	60	Limit distribution of degrees in random family trees	claim
1767	59	Playing Muller Games in a Hurry	claim
1768	59	Combinatorial Auctions with Budgets	claim
1769	59	Linear Recursion	claim
1770	59	Efficient Password-Typed Key Agreement Scheme	claim
1771	59	Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules	claim
1772	59	Hybrid approach for Image Encryption Using SCAN Patterns and Carrier Images	claim
1773	59	A Discussion of Thin Client Technology for Computer Labs	claim
1774	59	Social Attention and the Provider's Dilemma	claim
1775	59	Edge Growth in Graph Cubes	claim
1776	59	Spectral Perturbation and Reconstructability of Complex Networks	claim
1777	59	Component Based Development	claim
1778	59	The Light of Existence	claim
1779	59	Improved analysis of the subsampled randomized Hadamard transform	claim
1780	59	Parallel Chip Firing Game associated with n-cube orientations	claim
1781	59	Noise Invalidation Denoising	claim
1782	59	An Individual-based Probabilistic Model for Fish Stock Simulation	claim
1783	59	Refinement and Verification of Real-Time Systems	claim
1784	59	Agreement Maintenance Based on Schema and Ontology Change in P2P Environment	claim
1785	59	Quarantine generated phase transition in epidemic spreading	claim
1786	59	1D Effectively Closed Subshifts and 2D Tilings	claim
1787	59	Types for BioAmbients	claim
1788	59	Switched networks with maximum weight policies: Fluid approximation and multiplicative state space collapse	claim
1789	59	Pseudorandom Financial Derivatives	claim
1790	58	Timed Automata Semantics for Analyzing Creol	claim
1791	58	Pseudorandomness in Central Force Optimization	claim
1792	58	Verifying Recursive Active Documents with Positive Data Tree Rewriting	claim
1793	58	A fast vectorised implementation of Wallace's normal random number generator	claim
1794	58	On two variations of identifying codes	claim
1795	58	A Short Introduction to Kolmogorov Complexity	claim
1796	58	Genetic algorithms and the art of Zen	claim
1797	58	Structural Drift: The Population Dynamics of Sequential Learning	claim
1798	58	Optimal whitespace synchronization strategies	claim
1799	58	Minimization of Handoff Failure Probability for Next-Generation Wireless Systems	claim
1800	58	A Saturation Method for the Modal Mu-Calculus with Backwards Modalities over Pushdown Systems	claim
1801	58	Discrete denoising of heterogenous two-dimensional data	claim
1802	58	Soundly Handling Static Fields: Issues, Semantics and Analysis	claim
1803	58	Efficient Submodular Function Maximization under Linear Packing Constraints	claim
1804	58	Transformations of Logic Programs on Infinite Lists	claim
1805	58	Sorting Reordered Packets with Interrupt Coalescing	claim
1806	58	Channel-coded Collision Resolution by Exploiting Symbol Misalignment	claim
1807	58	Rich-club connectivity dominates assortativity and transitivity of complex networks	claim
1808	58	A calculus for costed computations	claim
1809	58	Extending ArXiv.org to Achieve Open Peer Review and Publishing	claim
1810	58	Image processing of a spectrogram produced by Spectrometer Airglow Temperature Imager	claim
1811	58	Detecting influenza outbreaks by analyzing Twitter messages	claim
1812	58	Liquidity in Credit Networks: A Little Trust Goes a Long Way	claim
1813	58	Complexity of Non-Monotonic Logics	claim
1814	58	Realizable Paths and the NL vs L Problem	claim
1815	58	Towards Correctness of Program Transformations Through Unification and Critical Pair Computation	claim
1816	58	Towards Theory of Massive-Parallel Proofs. Cellular Automata Approach	claim
1817	58	Fitness-driven deactivation in network evolution	claim
1818	58	Nefarious Numbers	claim
1819	58	Multi-Level Languages are Generalized Arrows	claim
1820	57	Open Graphs and Computational Reasoning	claim
1821	57	A new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller code	claim
1822	57	Optimal Control Strategies in Delayed Sharing Information Structures	claim
1823	57	Embedding Secret Data in HTML Web Page	claim
1824	57	Exact Ramsey Theory: Green-Tao numbers and SAT	claim
1825	57	Interactive Realizers and Monads	claim
1826	57	Gaussian Z-Interference Channel with a Relay Link: Achievability Region and Asymptotic Sum Capacity	claim
1827	57	A Repeated Game Formulation of Energy-Efficient Decentralized Power Control	claim
1828	57	Multitriangulations, pseudotriangulations and some problems of realization of polytopes	claim
1829	57	Minimization of Automata	claim
1830	57	Galois Theory of Algorithms	claim
1831	57	k-Edge-Connectivity: Approximation and LP Relaxation	claim
1832	57	Practical Range Aggregation, Selection and Set Maintenance Techniques	claim
1833	57	The Limits of Error Correction with lp Decoding	claim
1834	57	Balancing congestion for unsplittable routing on a bidirected ring	claim
1835	57	Slopes of Tilings	claim
1836	57	Syntax and Semantics of Babel-17	claim
1837	57	Characterizing Internet Worm Infection Structure	claim
1838	56	A Monadic Formalization of ML5	claim
1839	56	Information Fusion in the Immune System	claim
1840	56	Stability of the bipartite matching model	claim
1841	56	Impossibility of independence amplification in Kolmogorov complexity theory	claim
1842	56	An attack on MySQL's login protocol	claim
1843	56	A new proof of the graph removal lemma	claim
1844	56	Witness (Delaunay) Graphs	claim
1845	56	Grammar-Based Geodesics in Semantic Networks	claim
1846	56	Theory and Applications of Robust Optimization	claim
1847	56	The Computational Complexity of Linear Optics	claim
1848	56	Reflection and Hyper-Programming in Persistent Programming Systems	claim
1849	56	Better algorithms for satisfiability problems for formulas of bounded rank-width	claim
1850	56	MalStone: Towards A Benchmark for Analytics on Large Data Clouds	claim
1851	56	On the (non-)existence of polynomial kernels for Pl-free edge modification problems	claim
1852	56	Infinite computable version of Lovasz Local Lemma	claim
1853	56	Analysis and visualisation of RDF resources in Ondex	claim
1854	55	Structural Learning of Attack Vectors for Generating Mutated XSS Attacks	claim
1855	55	Using Financial Ratios to Identify Romanian Distressed Companies	claim
1856	55	Improved subspace estimation for multivariate observations of high dimension: the deterministic signals case	claim
1857	55	Non-oblivious Strategy Improvement	claim
1858	55	On a family of cubic graphs containing the flower snarks	claim
1859	55	End-Host Distribution in Application-Layer Multicast: Main Issues and Solutions	claim
1860	55	Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal	claim
1861	55	New and improved Johnson-Lindenstrauss embeddings via the Restricted Isometry Property	claim
1862	55	Tableaux for the Lambek-Grishin calculus	claim
1863	55	Use of multiple singular value decompositions to analyze complex intracellular calcium ion signals	claim
1864	55	On Zone-Based Analysis of Duration Probabilistic Automata	claim
1865	55	Chains-into-Bins Processes	claim
1866	55	Prediction with Advice of Unknown Number of Experts	claim
1867	55	From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference	claim
1868	55	Infinite Families of Optimal Splitting Authentication Codes Secure Against Spoofing Attacks of Higher Order	claim
1869	55	Solution space heterogeneity of the random $K$-satisfiability problem: Theory and simulations	claim
1870	55	Greedy Connectivity of Geographically Embedded Graphs	claim
1871	55	Robustness of Equations Under Operational Extensions	claim
1872	55	Loops under Strategies ... Continued	claim
1873	55	Building conceptual spaces for exploring and linking biomedical resources	claim
1874	54	Formal Theories for Logspace Counting	claim
1875	54	Not Every Domain of a Plain Decompressor Contains the Domain of a Prefix-Free One	claim
1876	54	Multidimensional Divide-and-Conquer and Weighted Digital Sums	claim
1877	54	Development of a Cargo Screening Process Simulator: A First Approach	claim
1878	54	Polynomial integration on regions defined by a triangle and a conic	claim
1879	54	Characterizing Optimal Sampling of Binary Contingency Tables via the Configuration Model	claim
1880	54	A Simple Abstraction for Data Modeling	claim
1881	54	Geometric Complexity Theory and Tensor Rank	claim
1882	54	Geoglyphs of Titicaca as an ancient example of graphic design	claim
1883	54	Properties of Exercise Strategies	claim
1884	54	Channel Decoding with a Bayesian Equalizer	claim
1885	54	Structure and Response in the World Trade Network	claim
1886	54	Finding topological subgraphs is fixed-parameter tractable	claim
1887	53	Fixed-Parameter Algorithms for Computing Kemeny Scores - Theory and Practice	claim
1888	53	Prequential Plug-In Codes that Achieve Optimal Redundancy Rates even if the Model is Wrong	claim
1889	53	Phase-Only Planar Antenna Array Synthesis with Fuzzy Genetic Algorithms	claim
1890	53	wiki.openmath.org - how it works, how you can participate	claim
1891	53	Experimental Evidence of Quantum Randomness Incomputability	claim
1892	53	Parametric polynomial minimal surfaces of arbitrary degree	claim
1893	53	Distributed solving through model splitting	claim
1894	53	Hidden Markov Models with Multiple Observation Processes	claim
1895	53	Hybrid Calculus of Wrapped Compartments	claim
1896	53	Lumpability Abstractions of Rule-based Systems	claim
1897	53	Multi-Agent Deployment for Visibility Coverage in Polygonal Environments with Holes	claim
1898	53	Distributed Work Stealing for Constraint Solving	claim
1899	53	How to evaluate universities in terms of their relative citation impacts: Fractional counting of citations and the normalization of differences among disciplines	claim
1900	52	New ways of scientific publishing and accessing human knowledge inspired by transdisciplinary approaches	claim
1901	52	On the Power of Unambiguity in Logspace	claim
1902	52	Weighted Logics for Nested Words and Algebraic Formal Power Series	claim
1903	52	Miniaturized wireless sensor network	claim
1904	52	On the complexity of stratified logics	claim
1905	52	Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers	claim
1906	52	Syntactic Abstraction of B Models to Generate Tests	claim
1907	52	Recognizability of Individual Creative Style Within and Across Domains: Preliminary Studies	claim
1908	52	Herbrand Consistency of Some Arithmetical Theories	claim
1909	52	The Forecasting of 3G Market in India Based on Revised Technology Acceptance Model	claim
1910	52	Learning Submodular Functions	claim
1911	52	Application Neutrality and a Paradox of Side Payments	claim
1912	52	Explicit constructions of RIP matrices and related problems	claim
1913	52	Towards a Study of Meta-Predicate Semantics	claim
1914	52	What's the point of documentation?	claim
1915	52	Pattern Kits	claim
1916	52	Computing the Fewest-turn Map Directions based on the Connectivity of Natural Roads	claim
1917	52	Automating Fine Concurrency Control in Object-Oriented Databases	claim
1918	52	Safe Feature Elimination in Sparse Supervised Learning	claim
1919	52	Hierarchy and information in feedforward networks	claim
1920	52	Cloud Migration: A Case Study of Migrating an Enterprise IT System to IaaS	claim
1921	52	Nonparametric Bayesian Sparse Factor Models with application to Gene Expression modelling	claim
1922	51	Exact Regeneration Codes for Distributed Storage Repair Using Interference Alignment	claim
1923	51	Trade-off capacities of the quantum Hadamard channels	claim
1924	51	Nurse Rostering with Genetic Algorithms	claim
1925	51	A Gibbs distribution that learns from GA dynamics	claim
1926	51	An Elliptic Curve-based Signcryption Scheme with Forward Secrecy	claim
1927	51	Prize-collecting Network Design on Planar Graphs	claim
1928	51	The Coarsest Precongruences Respecting Safety and Liveness Properties	claim
1929	51	Proliferating cell nuclear antigen (PCNA) allows the automatic identification of follicles in microscopic images of human ovarian tissue	claim
1930	51	On ternary square-free circular words	claim
1931	51	On Selective Unboundedness of VASS	claim
1932	51	First results of the SOAP project. Open access publishing in 2010	claim
1933	51	A Clustering Coefficient Network Formation Game	claim
1934	51	Catastrophic Cascade of Failures in Interdependent Networks	claim
1935	50	On the d-complexity of strings	claim
1936	50	Relating Nominal and Higher-order Abstract Syntax Specifications	claim
1937	50	A New Mechanism for Maintaining Diversity of Pareto Archive in Multiobjective Optimization	claim
1938	50	Dynamic IDP Signature processing by fast elimination using DFA	claim
1939	50	Geometric Approximations of Some Aloha-like Stability Regions	claim
1940	50	A Fluid Limit for an Overloaded X Model Via an Averaging Principle	claim
1941	50	A Complete and Terminating Execution Model for Constraint Handling Rules	claim
1942	50	Dodgson's Rule Approximations and Absurdity	claim
1943	50	Coarse Network Coding: A Simple Relay Strategy to Resolve Interference	claim
1944	50	Multiparty Symmetric Sum Types	claim
1945	50	Matrix Structure Exploitation in Generalized Eigenproblems Arising in Density Functional Theory	claim
1946	50	How Accurate is Mean-Field Theory for Dynamics on Real-World Networks?	claim
1947	50	Lecture Notes on Network Information Theory	claim
1948	50	Separating Bounded Arithmetics by Herbrand Consistency	claim
1949	49	Towards the Design of Heuristics by Means of Self-Assembly	claim
1950	49	Quantitative Fairness Games	claim
1951	49	Augmented Lattice Reduction for MIMO decoding	claim
1952	49	Generating and ranking of Dyck words	claim
1953	49	Stability of fast algorithms for structured linear systems	claim
1954	49	Counting dependent and independent strings	claim
1955	49	Distributed Algorithms for Learning and Cognitive Medium Access with Logarithmic Regret	claim
1956	49	Growth and structure of Slovenia's scientific collaboration network	claim
1957	49	Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform	claim
1958	49	Nonuniversal power law scaling in the probability distribution of scientific citations	claim
1959	49	A Sparser Johnson-Lindenstrauss Transform	claim
1960	49	Citations and impact of Dutch astronomy	claim
1961	48	A General Coding Scheme for Two-User Fading Interference Channels	claim
1962	48	Are there any good digraph width measures?	claim
1963	48	An Implicit Characterization of PSPACE	claim
1964	48	An ODE for an Overloaded X Model Involving a Stochastic Averaging Principle	claim
1965	48	Testing Closeness of Discrete Distributions	claim
1966	48	Stochastic Flips on Two-letter Words	claim
1967	48	Solving the Cold-Start Problem in Recommender Systems with Social Tags	claim
1968	48	Min-Rank Conjecture for Log-Depth Circuits	claim
1969	48	Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits	claim
1970	48	A criterion for separating process calculi	claim
1971	48	Termination of Rewriting with and Automated Synthesis of Forbidden Patterns	claim
1972	48	On Maxwell fluid with relaxation time and viscosity depending on the pressure	claim
1973	48	Isomorphisms of Algebraic Number Fields	claim
1974	48	PageRank for ranking authors in co-citation networks	claim
1975	48	Non-negative Weighted #CSPs: An Effective Complexity Dichotomy	claim
1976	48	Algebraic Theories over Nominal Sets	claim
1977	48	E-Net Models of a Software System for E-Mail Security	claim
1978	47	Investigating modularity in the analysis of process algebra models of biochemical systems	claim
1979	47	A Graphical Approach to Progress for Structured Communication in Web Services	claim
1980	47	On the Pseudocodeword Redundancy	claim
1981	47	Avoiding Interruptions - QoE Trade-offs in Block-coded Streaming Media Applications	claim
1982	47	Tuple-based abstract data types: full parallelism	claim
1983	47	Gameplay experience in a gaze interaction game	claim
1984	47	Tools and techniques for Network Forensics	claim
1985	47	An O(M(n) log n) algorithm for the Jacobi symbol	claim
1986	47	Lower bounds for the error decay incurred by coarse quantization schemes	claim
1987	47	Robustness and Generalization	claim
1988	47	Observation-Driven Configuration of Complex Software Systems	claim
1989	47	The Local Lemma Is Tight for SAT	claim
1990	47	Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor	claim
1991	47	On the Estimation of Coherence	claim
1992	47	Information Analysis of DNA Sequences	claim
1993	47	Quantum Key Distribution (QKD) and Commodity Security Protocols: Introduction and Integration	claim
1994	47	Asynchronous Capacity per Unit Cost	claim
1995	47	Applications of Lindeberg Principle in Communications and Statistical Learning	claim
1996	47	Sampling and Recovery of Pulse Streams	claim
1997	47	Intersection types for unbind and rebind	claim
1998	47	A hands-on Assessment of Transport Protocols with Lower than Best Effort Priority	claim
1999	47	Percolation in self-similar networks	claim
2000	47	Ontology Usage at ZFIN	claim
2001	47	Non Abelian Bent Functions	claim
2002	46	Optimal Time-Abstract Schedulers for CTMDPs and Markov Games	claim
2003	46	Principal manifolds and graphs in practice: from molecular biology to dynamical systems	claim
2004	46	Medium Access Control for Wireless Sensor Networks based on Impulse Radio Ultra Wideband	claim
2005	46	Realizability algebras: a program to well order R	claim
2006	46	A Formalization of the Turing Test	claim
2007	46	Intrusions into Privacy in Video Chat Environments: Attacks and Countermeasures	claim
2008	46	Quantum Channel Capacities	claim
2009	46	A rate-distortion scenario for the emergence and evolution of noisy molecular codes	claim
2010	46	Home Automation	claim
2011	46	The emergence of the physical world from information processing	claim
2012	46	Limits of Commutativity on Abstract Data Types	claim
2013	46	The Role of Provenance Management in Accelerating the Rate of Astronomical Research	claim
2014	46	Beating the Productivity Checker Using Embedded Languages	claim
2015	46	Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning	claim
2016	46	Relational transducers for declarative networking	claim
2017	45	L-systems in Geometric Modeling	claim
2018	45	Algebraic Linear Orderings	claim
2019	45	Rivals for the crown: Reply to Opthof and Leydesdorff	claim
2020	45	Solution to the Counterfeit Coin Problem and its Generalization	claim
2021	45	Colored Gaussian Multiple Descriptions: Spectral-Domain Characterization and Time-Domain Design	claim
2022	45	A self-managing fault management mechanism for wireless sensor networks	claim
2023	45	Exact, Efficient and Information-Theoretically Secure Voting with an Arbitrary Number of Cheaters	claim
2024	45	Relating timed and register automata	claim
2025	45	Inter-arrival times of message propagation on directed networks	claim
2026	45	Minimizing Communication for Eigenproblems and the Singular Value Decomposition	claim
2027	45	Primitives for Contract-based Synchronization	claim
2028	45	Threshold effects in parameter estimation as phase transitions in statistical mechanics	claim
2029	45	Exploiting Grids for applications in Condensed Matter Physics	claim
2030	45	How to generate an object under an ordinary Boltzmann distribution via an exponential Boltzmann sampler	claim
2031	45	The Shannon Cipher System with a Guessing Wiretapper: General Sources	claim
2032	45	Complementary approaches to understanding the plant circadian clock	claim
2033	45	Untangling Typechecking of Intersections and Unions	claim
2034	45	On Achievable Rates for Non-Linear Deterministic Interference Channels	claim
2035	45	Subset feedback vertex set is fixed parameter tractable	claim
2036	45	Bisimulation for quantum processes	claim
2037	45	An Optimization-Based Framework for Automated Market-Making	claim
2038	45	Work-stealing for mixed-mode parallelism by deterministic team-building	claim
2039	45	Accessible Capacity of Secondary Users	claim
2040	45	Device-independent quantum key distribution	claim
2041	45	FORM facts	claim
2042	45	Pareto Optimal Solutions for Smoothed Analysts	claim
2043	44	Open Access Mandates and the "Fair Dealing" Button	claim
2044	44	Universal Sparse Modeling	claim
2045	44	Simulating Customer Experience and Word Of Mouth in Retail - A Case Study	claim
2046	44	Learning Kernel-Based Halfspaces with the Zero-One Loss	claim
2047	44	Discrete Vector Fields and Fundamental Algebraic Topology	claim
2048	44	Smoothness, Low-Noise and Fast Rates	claim
2049	44	Position-Based Quantum Cryptography: Impossibility and Constructions	claim
2050	44	Evolution of National Nobel Prize Shares in the 20th Century	claim
2051	44	Approximately Optimal Wireless Broadcasting	claim
2052	44	Analyse multigraduelle OLAP	claim
2053	44	Source Polarization	claim
2054	44	Breaking the O(n^2) Bit Barrier: Scalable Byzantine agreement with an Adaptive Adversary	claim
2055	44	What we understand is what we get: Assessment in Spreadsheets	claim
2056	44	Combinatorial substitutions and sofic tilings	claim
2057	44	Structural Analysis of Boolean Equation Systems	claim
2058	44	Policies and Economics of Digital Multimedia Transmission	claim
2059	44	Maximum union-free subfamilies	claim
2060	43	Explicit Substitutions for Contextual Type Theory	claim
2061	43	BitTorrent Experiments on Testbeds: A Study of the Impact of Network Latencies	claim
2062	43	Competitive Equilibria in Matching Markets with Budgets	claim
2063	43	The space complexity of recognizing well-parenthesized expressions	claim
2064	43	Linear Cellular Automata as Discrete Models for Generating Cryptographic Sequences	claim
2065	43	Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions	claim
2066	43	Exact Localization and Superresolution with Noisy Data and Random Illumination	claim
2067	43	Rate Region Frontiers for n-user Interference Channel with Interference as Noise	claim
2068	43	Vcache: Caching Dynamic Documents	claim
2069	43	Transparent Anonymization: Thwarting Adversaries Who Know the Algorithm	claim
2070	43	Effective Capacity and Randomness of Closed Sets	claim
2071	43	Watching Systems in graphs: an extension of Identifying Codes	claim
2072	43	Quantum query complexity of minor-closed graph properties	claim
2073	42	Begin, After, and Later: a Maximal Decidable Interval Temporal Logic	claim
2074	42	Local Strategy Improvement for Parity Game Solving	claim
2075	42	Reduced ML-Decoding Complexity, Full-Rate STBCs for 4 Transmit Antenna Systems	claim
2076	42	Identification of Logical Errors through Monte-Carlo Simulation	claim
2077	42	NumGfun: a Package for Numerical and Analytic Computation with D-finite Functions	claim
2078	42	Noisy Network Coding	claim
2079	42	A Global Optimisation Toolbox for Massively Parallel Engineering Optimisation	claim
2080	42	Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability	claim
2081	42	Fixed-parameter tractability of multicut parameterized by the size of the cutset	claim
2082	42	Non-Separable, Quasiconcave Utilities are Easy -- in a Perfect Price Discrimination Market Model	claim
2083	42	Flexible Session Management in a Distributed Environment	claim
2084	42	On the Implementation of Dynamic Patterns	claim
2085	41	Feature Extraction for Universal Hypothesis Testing via Rank-constrained Optimization	claim
2086	41	Cleaning Interval Graphs	claim
2087	41	Roomy: A System for Space Limited Computations	claim
2088	41	Functional Answer Set Programming	claim
2089	41	Realizability algebras II : new models of ZF + DC	claim
2090	41	Collaborative Structuring of Knowledge by Experts and the Public	claim
2091	41	Non-orthodox combinatorial models based on discordant structures	claim
2092	41	Theory of processes	claim
2093	41	Decomposition Complexity	claim
2094	40	Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs	claim
2095	40	Compound Poisson Approximation via Information Functionals	claim
2096	40	Compressed Sensing with off-axis frequency-shifting holography	claim
2097	40	Real-time and Probabilistic Temporal Logics: An Overview	claim
2098	40	Unary Subset-Sum is in Logspace	claim
2099	39	A betting interpretation for probabilities and Dempster-Shafer degrees of belief	claim
2100	39	What Can Heterogeneity Add to the Scientometric Map? Steps towards algorithmic historiography	claim
2101	39	Nonparametric Estimation and On-Line Prediction for General Stationary Ergodic Sources	claim
2102	39	A Majorization-Minimization Approach to Design of Power Transmission Networks	claim
2103	39	Threat assessment of a possible Vehicle-Born Improvised Explosive Device using DSmT	claim
2104	39	Quantum Tagging: Authenticating Location via Quantum Information and Relativistic Signalling Constraints	claim
2105	39	A Quartic Kernel for Pathwidth-One Vertex Deletion	claim
2106	39	Congestion in planar graphs with demands on faces	claim
2107	39	Non-redundant random generation from weighted context-free languages	claim
2108	38	Generalised Rabin(1) synthesis	claim
2109	38	Normalized Range Voting Broadly Resists Control	claim
2110	38	Ranking with Submodular Valuations	claim
2111	38	On the optimal stacking of noisy observations	claim
2112	38	Exponential Time Complexity of Weighted Counting of Independent Sets	claim
2113	38	Quartic Curves and Their Bitangents	claim
2114	38	Diffusion and Cascading Behavior in Random Networks	claim
2115	37	The Cardinality of an Oracle in Blum-Shub-Smale Computation	claim
2116	37	Circuit partitions and #P-complete products of inner products	claim
2117	37	Constructions from Dots and Lines	claim
2118	37	A Unique 10 Segment Display for Bengali Numerals	claim
2119	37	Spin systems dynamics and faults detection in threshold networks	claim
2120	37	The assembly modes of rigid 11-bar linkages	claim
2121	37	Multi-Shift de Bruijn Sequence	claim
2122	35	The lattice of embedded subsets	claim
2123	34	Interdiction of a Markovian Evader	claim
2124	34	Statistical Modelling of ft to Process Parameters in 30 nm Gate Length Finfets	claim
2125	34	Uncurrying for Innermost Termination and Derivational Complexity	claim
2126	32	Can Realistic BitTorrent Experiments Be Performed on Clusters?	claim
2127	28	Technological Strategy of Using Global Positioning System: An Analysis	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers