|
 | Up a level |
Arun, R and Suresh, Vommina and Madhavan, Veni CE and Murty, Narasimha M (2010) On Finding the Natural Number of Topics with Latent Dirichlet Allocation: Some Observations. In: 14th Pacific-Asia Conference on Knowledge Discovery and Data Mining, JUN 21-24, 2010, Hyderabad, pp. 391-402.
Kolavali, Sudha Rani and Bhatnagar, Shalabh (2009) Ant Colony Optimization Algorithms for Shortest Path Problems. [Book Chapter]
Bhadra, Sahely and Nath, J Saketha and Ben-Tal, Aharou and Bhattacharyya, Chiranjib (2009) Interval Data Classification under Partial Information: A Chance-Constraint Approach. In: Lecture Notes in Computer Science, 5476 . pp. 208-219.
Vats, Nitin (2008) Algebraic Cryptanalysis of CTRU Cryptosystem. In: 14th Annual International Conference on Computing and Combinatorics (COCOON 2008), JUN 27-29, 2008, China, pp. 235-244.
D’Souza, Deepak and Gopinathan, Madhu (2008) Conflict-Tolerant Features. In: 20th International Conference on Computer Aided Verification, JUL 07, 2008, Princeton, pp. 227-239.
Agnihotri, Samar and Nuggehalli, Pavan and Jamadagni, HS (2008) Correlation, Coding, and Cooperation in Wireless Sensor Networks. In: Lecture Notes in Computer Science, 4837 . pp. 83-98.
Jain, Divya and Lakshmi, K Vasanta and Shankar, Priti (2008) Deep Packet Inspection Using Message Passing Networks. In: Lecture Notes in Computer Science, 5230 . pp. 419-420.
Kumar, Chetan and Kumar, Nishith and Rangarajan, Sarani and Balakrishnan, Narayanaswamy and Sekar, Kanagaraj (2008) A Method to Find Sequentially Separated Motifs in Biological Sequences (SSMBS). In: 3rd IAPR International Conference on Pattern Recognition in Bioinformatics, OCT 15-17, 2008, Melbourne, Australia, pp. 13-27.
Gujar, Sujit and Yadati, Narahari (2008) Redistribution of VCG Payments in Assignment of Heterogeneous Objects. In: 4th International Workshop on Internet and Network Economics, DEC 17-20, 2008, Shanghai, Peoples republic china, pp. 438-445.
Suri, N Rama and Srinivas, VS and Murty, M Narasimha (2007) A cooperative game theoretic approach to prototype selection. In: 18th European Conference on Machine Learning (ECML 2007)/11th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD 2007), SEP 17-21, Warsaw Univ, Warsaw, POLAND.
Prabhakar, Pavithra and D’Souza, Deepak (2006) On the Expressiveness of MTL with Past Operators. [Book Chapter]
Abraham, David J and Telikepalli, Kavitha (2006) Dynamic Matching Markets and Voting Paths. In: Algorithm Theory-SWAT 2006. 10th Scandinavian Workshop on Algorithm Theory. Proceedings, 6-8 July 2006, Riga, Latvia, pp. 65-76.
Subramanian, Hariharan and Shankar, Priti (2006) Compressing XML Documents Using Recursive Finite State Automata. In: Lecture Notes in Computer Science, 3845 . pp. 282-293.
Kaipa, KN and Puttappa, A and Hegde, GM and Bidargaddi, SV and Ghose, D (2006) Rendezvous of glowworm-inspired robot swarms at multiple source locations: A sound source based real-robot implementation. In: Ant Colony Optimization and Swarm Intelligence. 5th International Workshop, ANTS 2006, 4-7 Sep. 2006, Brussels, Belgium, pp. 259-269.
Ramachandran, Parthasarathy (2006) Use of Extended Euclidean Algorithm in Solving a System of Linear Diophantine Equations with Bounded Variables. In: Lecture Notes in Computer Science, 4076 . pp. 182-192.
Roy, Amitabha and Gopinath, K (2005) Improved Probabilistic Models for 802.11 Protocol Verification. [Book Chapter]
Hansen, Kristoffer Arnsfelt and Miltersen, Peter Bro and Vinay, V (2003) Circuits on cylinders. In: Lecture Notes in Computer Science, 2751 . pp. 171-182.
Shenoy, Deepa P and Srinivasa, KG and Mithun, MP and Venugopal, KR and Patnaik, LM (2003) Dynamic subspace clustering for very large high-dimensional databases. In: Lecture Notes in Computer Science, 2690 . pp. 850-854.
Chakraborty, A and Mahapatra, Roy D and Gopalakrishnan, S (2003) Finite element simulation of BAW propagation in inhomogeneous plate due to piezoelectric actuation. In: Lecture Notes in Computer Science, 2668 . pp. 715-724.
Chandru, Vijay and Lassez, Jean-Louis (2003) Qualitative theorem proving in linear constraints. In: Lecture Notes in Computer Science, 2772 . pp. 395-406.
Rao, Pradeep H and Nandy, SK and Kiran, Satya MNV (2003) Simultaneous MultiStreaming for complexity-effective VLIW architectures. In: Lecture Notes in Computer Science, 2823 . pp. 166-179.
Sarvani, VVNS and Govindarajan, R (2003) Unified instruction reordering and algebraic transformations for minimum cost offset. In: Lecture Notes in Computer Science, 2826 . pp. 270-284.
Venkatesha Prasad, R and Jamadagni, HS and Sangwan, Abhijeet and Chiranth, MC (2003) VAD for VoIP using cepstrum. In: Lecture Notes in Computer Science, 2720 . pp. 522-530.
Sarma, Radhika A and Govindarajan, R (2003) An efficient web cache replacement policy. In: Lecture Notes in Computer Science, 2913 . 12-22 .
Mahapatra, Roy D and Gopalakrishnan, S (2003) A nonlinear spectral finite element model for analysis of wave propagation in solid with internal friction and dissipation. In: Lecture Notes in Computer Science, 2668 . pp. 745-754.
Chandran, Sunil L and Ram, Shankar L (2002) Approximations for ATSP with Parametrized Triangle Inequality. [Book Chapter]
Kumar, Vinodh R and Narayanan, Lakshmi B and Govindarajan, R (2002) Dynamic path profile aided recompilation in a JAVA just-in-time compiler. In: Lecture Notes in Computer Science, 2552 . pp. 495-505.
Ravindra, DV and Srikant, YN (2002) Improved preprocessing methods for modulo scheduling algorithms. In: Lecture Notes in Computer Science, 2552 . pp. 485-494.
Sen, Sourav and Narahari, Y (2002) Improving web server performance by network aware data buffering and caching. In: Lecture Notes in Computer Science, 2552 . pp. 242-251.
Kumar, Vijay B and Ramakrishnan, AG (2002) Machine recognition of printed Kannada text. In: Lecture Notes in Computer Science, 2423 . pp. 37-48.
Patnaik, LM and Suvernkar, Anand (2002) Multipath routing to provide quality of service in mobile ad hoc networks. In: Lecture Notes in Computer Science, 2571 . pp. 154-163.
Dhanya, D and Ramakrishnan, AG (2002) Optimal feature extraction for bilingual OCR. In: Lecture Notes in Computer Science, 2423 . pp. 25-36.
Aparna, KG and Ramakrishnan, AG (2002) A complete Tamil Optical Character Recognition System. In: Lecture Notes in Computer Science, 2423 . pp. 53-57.
Hansdah, RC and Gantait, Nilanjan and Dey, Sandip (2002) A fault-tolerant distributed deadlock detection algorithm. In: Lecture Notes in Computer Science, 2571 . pp. 78-87.
Gopikrishna, D and Makur, Anamitra (2002) A high performance scheme for EEG compression using a multichannel model. In: Lecture Notes in Computer Science, 2552 . 443-451 .
Kameshwaran, S and Narahari, Y (2002) A new approach to the design of electronic exchanges. In: Lecture Notes in Computer Science, 2455 . 27-36 .
Dey, Sandip and Pal, Arindam (2002) A token-based distributed algorithm for total order atomic broadcast. In: Lecture Notes in Computer Science, 2571 . pp. 343-347.
Narayanaswamy, NS and Madhavan, Veni CE (2001) On Assigning Prefix Free Codes to the Vertices of a Graph. [Book Chapter]
Lakshminarayanan, S and Ghosh, SS and Balakrishnan, N (1999) Implementation of MPI over HTTP. In: Lecture Notes in Computer Science, 1593 . pp. 1299-1302.
Sreenivasa, Kumar P and Veni, Madhavan (1989) A new class of separators and planarity of chordal graphs. [Book Chapter]
Sastry, Shanthi P and Jayakumar, N and Madhavan, Veni CE (1987) Efficient algorithms for domination and Hamilton circuit problems on permutation graphs. In: Lecture Notes in Computer Science, 287 . 65 -78.
Hansdah, RC and Patnaik, LM (1987) Weak consistency of read-only transactions: A tool to improve concurrency in heterogeneous locking protocols. In: Lecture Notes in Computer Science, 287 . 265 -281.
Lakshmanan, VS and Madhavan, Veni CE (1986) Binary decompositions and acyclic schemes. In: Lecture Notes in Computer Science, 241 . pp. 214-238.
Narahari, Y and Viswanadham, N (1986) On the invariants of coloured Petri Nets. In: Lecture Notes in Computer Science, 222 . 330 -345.
Lakshmanan, VS and Madhavan, CEV (1985) The Implication Problem for Functional and Multivalued Dependencies. In: Lecture Notes in Computer Science, 206 . pp. 303-328.
Madhavan, CEV (1984) Approximation algorithm for maximum independent set in planar traingle-free graphs. In: Lecture Notes in Computer Science, 181 . pp. 381-392.
Goswami, AK and Patnaik, LM (1984) Functional programming systems revisited. In: Lecture Notes in Computer Science, 181 . pp. 44-59.
